Survivable Traffic Grooming with Impairment Constraints

In this paper, we address the problem of survivable traffic grooming in optical WDM networks in which lightpaths are hop constrained. Survivability is provisioned at the wavelength granularity through either dedicated or shared path protection schemes. We propose an auxiliary-graph-based algorithm that addresses grooming, protection, and impairment constraints in a combined manner and that determines the placement of regenerators and grooming equipment in the network with the goal of minimizing equipment cost. Numerical results illustrate that the proposed algorithm outperforms an algorithm in which grooming, protection, and impairments are handled separately. We also evaluate effects of different equipment placement policies on the network cost and evaluate the cost-performance trade-offs for different network line rates.