Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory

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].
Fichier principal
Vignette du fichier
BC-ICC03.pdf (96.98 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00429174 , version 1 (01-11-2009)

Identifiers

Cite

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⟩
126 View
189 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More