Survivable impairment-aware traffic grooming in WDM rings

Wavelength Division Multiplexing (WDM) optical networks offer a large amount of bandwidth using multiple, but independent wavelength channels (or lightpaths), each operating at several Gb/s. Since the traffic between users is usually only a fraction of the capacity offered by a wavelength, several independent traffic streams can be groomed together. In addition, in order to reverse the effect of noise and signal degradations (physical impairments), optical signals need to be regenerated after a certain impairment threshold is reached. We consider survivable impairment-aware traffic grooming in WDM rings, which are among the most widely deployed optical network topologies. We first show that the survivable impairment-aware traffic grooming problem, where the objective is to minimize the total cost of grooming and regeneration, is NP-hard. We then provide approximation algorithms (for uniform traffic), and efficient heuristic algorithms whose performance is shown to be close to the lower-bounds (for non-uniform traffic) both when (1) the impairment threshold can be ignored, and (2) the impairment threshold should be considered.

[1]  Philip J. Lin,et al.  The ring grooming problem , 2004, Networks.

[2]  Rudra Dutta,et al.  Minimizing transceivers in optical path networks , 2009 .

[3]  Paparao Palacharla,et al.  Traffic grooming and regenerator placement in impairment-aware optical WDM networks , 2010, 2010 14th Conference on Optical Network Design and Modeling (ONDM).

[4]  J. M. Simmons,et al.  Optical Network Design and Planning , 2008 .

[5]  Ahmed E. Kamal,et al.  Design and Provisioning of WDM Networks With Many-to-Many Traffic Grooming , 2010, IEEE/ACM Transactions on Networking.

[6]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[7]  Piet Demeester,et al.  Optical networking: past, present and future , 2000 .

[8]  Harry G. Perros,et al.  Cost-effective single-hub WDM ring networks: A proposal and analysis , 2007, Comput. Networks.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Stéphane Pérennes,et al.  Hardness and Approximation of Traffic Grooming , 2007, ISAAC.

[11]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2003, IEEE Journal on Selected Areas in Communications.

[12]  Ran Libeskind-Hadas,et al.  Competitive analysis of online traffic grooming in WDM rings , 2008, TNET.

[13]  Gianpiero Monaco,et al.  Optimizing regenerator cost in traffic grooming , 2011, Theor. Comput. Sci..

[14]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[15]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[16]  Arun K. Somani.  Survivable Traffic Grooming , 2008 .

[17]  Biswanath Mukherjee,et al.  Traffic grooming for survivable WDM networks: dedicated protection [Invited] , 2004 .

[18]  Piet Van Mieghem,et al.  Impairment-aware path selection and regenerator placement in translucent optical networks , 2010, The 18th IEEE International Conference on Network Protocols.

[19]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[20]  Byrav Ramamurthy,et al.  Survivable traffic grooming in WDM mesh networks under SRLG constraints , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[21]  Suresh Subramaniam,et al.  Survivable traffic grooming in WDM ring networks , 2007, Journal of Communications and Networks.