Abstract

In this paper, we address the problem of survivable traffic grooming and regenerator placement in optical wavelength division multiplexing (WDM) networks with impairment constraints. The working connections are protected end to end by provisioning bandwidth along a sequence of lightpaths through either a dedicated or a shared connection-level protection scheme. We propose an auxiliary-graph-based approach to address the placement of regenerators and grooming equipment for both working and backup connections in the network in order to minimize the total equipment cost. Simulation results show that the proposed algorithms outperform lightpath-level protection algorithms, in which each lightpath is protected separately. We also show the performance of connection-level protection under both dedicated and shared protection schemes in terms of the network cost, along with the effect of different cost models on equipment placement and performance for networks with different line rates. The restoration time of dedicated and shared connection-level protection is also investigated.

©2012 Optical Society of America

New Strategies for Connection Protection in Mixed-Line-Rate Optical WDM Networks

Menglin Liu, Massimo Tornatore, and Biswanath Mukherjee
J. Opt. Commun. Netw. 3(9) 641-650 (2011)

Stable Logical Topologies for Survivable Traffic Grooming of Scheduled Demands

Arunita Jaekel, Ying Chen, and Ataul Bari
J. Opt. Commun. Netw. 2(10) 793-802 (2010)

Survivable Multipath Traffic Grooming in Telecom Mesh Networks With Inverse Multiplexing

Sheng Huang, Ming Xia, Chip Martel, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(8) 545-557 (2010)

Exploiting Excess Capacity for Survivable Traffic Grooming in Optical Backbone Networks

Ferhat Dikbiyik, Massimo Tornatore, and Biswanath Mukherjee
J. Opt. Commun. Netw. 6(2) 127-137 (2014)

Impairment-Aware Design of Translucent DWDM Networks Based on the k-Path Connectivity Graph

Giuseppe Rizzelli, Massimo Tornatore, Guido Maier, and Achille Pattavina
J. Opt. Commun. Netw. 4(5) 356-365 (2012)