Cost and Power-Consumption Analysis for Power Profile Monitoring with Multiple Monitors per Link in Optical Networks

TL;DR

This work tackles the high cost and power consumption of optical-network monitoring by evaluating Power Profile Monitoring (PPM) as a scalable alternative to per-span OTDR. It formalizes the Optimized Monitoring Placement (OMP) problem, proves its NP-hardness, and offers an Integer Linear Programming model plus a scalable heuristic to minimize unsatisfied monitoring density (NPL) while reducing the number of PPMs. Through extensive simulations on realistic topologies (J14 and N14) and architecture scenarios (opaque and transparent IPoWDM), the paper demonstrates substantial reductions in required monitoring hardware and quantifies cost and power trade-offs relative to OTDR. The results yield concrete crossing values indicating when PPM is economically viable, with guidance showing that, under optimized placement, PPM can be markedly more cost- and energy-efficient, especially in larger networks, thus informing deployment strategies and future field experiments.

Abstract

As deploying large amounts of monitoring equipment results in elevated cost and power consumption, novel low-cost monitoring methods are being continuously investigated. A new technique called Power Profile Monitoring (PPM) has recently gained traction thanks to its ability to monitor an entire lightpath using a single post-processing unit at the lightpath receiver. PPM does not require to deploy an individual monitor for each span, as in the traditional monitoring technique using Optical Time-Domain Reflectometer (OTDR). In this work, we aim to quantify the cost and power consumption of PPM (using OTDR as a baseline reference), as this analysis can provide guidelines for the implementation and deployment of PPM. First, we discuss how PPM and OTDR monitors are deployed, and we formally state a new Optimized Monitoring Placement (OMP) problem for PPM. Solving the OMP problem allows to identify the minimum number of PPM monitors that guarantees that all links in the networks are monitored by at least $n$ PPM monitors (note that using $n>1$ allows for increased monitoring accuracy). We prove the NP-hardness of the OMP problem and formulate it using an Integer Linear Programming (ILP) model. Finally, we also devise a heuristic algorithm for the OMP problem to scale to larger topologies. Our numerical results, obtained on realistic topologies, suggest that the cost (and power) of one PPM module should be lower than 2.6 times that of one OTDR for nation-wide and 10.2 times for continental-wide topology.

Figures (11)

• Figure 1: Network-wide PPM deployment.
• Figure 2: Network-wide OTDR deployment.
• Figure 3: Illustrative Example of Deployment of PPM at Nokia Testbed.
• Figure 4: Illustration of the OMP algorithm.
• Figure 5: Comparison of the OMP algorithm and ILP.