Abstract

We consider the problem of traffic grooming in wavelength-division-multiplexing rings with all-to-all uniform traffic. Our objective is to minimize the total number of electronic add-drop multiplexers (ADMs) required. We derive explicit optimal solutions for two special cases: one with a traffic granularity of 4 and the other with 16. When the traffic granularity is equal to 4, we also show that the minimum number of ADMs can be achieved either with the minimum number of wavelengths, a result that was conjectured in earlier research [J. Lightwave Technol. 18, 2 (2000)], or with ADMs uniformly placed among nodes. Our results here are among the few in which analytically tractable optimal solutions are obtained for the traffic grooming problem. Our solutions provide insight as well as valuable tools for evaluating other approximate and heuristic algorithms.

© Optical Society of America

Grooming Traffic to Maximize Throughput in SONET Rings

Charles J. Colbourn, Gaetano Quattrocchi, and Violet R. Syrotiuk
J. Opt. Commun. Netw. 3(1) 10-16 (2011)

A Near-Optimal Solution Approach for the Multi-hop Traffic Grooming Problem

Ali Balma, Nejib Ben Hadj-Alouane, and Atidel B. Hadj-Alouane
J. Opt. Commun. Netw. 3(11) 891-901 (2011)

Many-to-Many Traffic Grooming in WDM Networks

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

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)

Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks

Bijoy Chand Chatterjee, Nityananda Sarma, and Partha Pritim Sahu
J. Opt. Commun. Netw. 4(6) 480-489 (2012)