Skip to Main content Skip to Navigation
Conference papers

Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory

Jean-Claude Bermond 1 David Coudert 1 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges (where C is the grooming ratio) and where the total number of vertices has to be minimized. Using tools of graph and design theory, we optimally solve the problem for practical values and infinite congruence classes of values for a given C , and thus improve and unify all the preceding results. We disprove a conjecture of [7] saying that the minimum number of ADMs cannot be achieved with the minimum number of wavelengths, and also another conjecture of [17].
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : David Coudert Connect in order to contact the contributor
Submitted on : Sunday, November 1, 2009 - 2:49:32 PM
Last modification on : Thursday, August 4, 2022 - 4:52:39 PM
Long-term archiving on: : Thursday, June 17, 2010 - 6:54:22 PM


Files produced by the author(s)




Jean-Claude Bermond, David Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. IEEE International Conference on Communications (ICC '03)., May 2003, Anchorage, United States. pp.1402 - 1406, ⟨10.1109/ICC.2003.1204621⟩. ⟨inria-00429174⟩



Record views


Files downloads