Abstract

Traffic grooming techniques are used to combine low-speed individual requests for connections onto high-speed lightpaths in an efficient manner. Design of survivable grooming capable networks is of critical importance. For such networks, protection may take place at the lightpath level or at the connection level. However, optimal formulations for implementing protection at either level are computationally intractable and can only be used for very small networks. We present an efficient integer linear program (ILP) formulation for the complete survivable traffic grooming problem, including topology design, traffic routing, and routing and wavelength assignment, using both dedicated and shared protection at the lightpath level. Unlike existing formulations, our ILP is able to generate optimal solutions for practical sized networks with hundreds of traffic requests.

© 2008 Optical Society of America

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)

Multicast Traffic Grooming in Tap-and-Continue WDM Mesh Networks

Rongping Lin, Wen-De Zhong, Sanjay Kumar Bose, and Moshe Zukerman
J. Opt. Commun. Netw. 4(11) 918-935 (2012)

Regeneration and grooming in MPLS over WDM networks

Bruna Nogueira, Ricardo Mendes, Lúcia Martins, Teresa Gomes, Rita Girão-Silva, João Santos, and Tibor Cinkler
J. Opt. Commun. Netw. 11(8) 465-477 (2019)

Many-to-Many Traffic Grooming in WDM Networks

Mohammad A. Saleh and Ahmed E. Kamal
J. Opt. Commun. Netw. 1(5) 376-391 (2009)

Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks

André C. Drummond and Nelson L.S. da Fonseca
J. Opt. Commun. Netw. 2(6) 305-318 (2010)