Skip to Main content Skip to Navigation
Conference papers

Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case

Jean-Claude Bermond 1 David Coudert 1 Xavier Munoz 2
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. 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 . Among others, we give optimal constructions when C ≥ N (N − 1)/6 and results when C = 12. We also show how to improve lower bounds by using refined counting techniques, and how to use efficiently an ILP program by restricting the search space.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00429175
Contributor : David Coudert <>
Submitted on : Sunday, November 1, 2009 - 2:58:12 PM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Thursday, June 17, 2010 - 6:54:44 PM

File

BCM-ONDM03.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00429175, version 1

Collections

Citation

Jean-Claude Bermond, David Coudert, Xavier Munoz. Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case. 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. pp.1135-1153. ⟨inria-00429175⟩

Share

Metrics

Record views

354

Files downloads

139