Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6

Abstract : SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sites employs no more than $\frac{1}{6}$ of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number N of sites satisfies $N \equiv 1 \pmod{3}$, the determination is complete, and when $N \equiv 2 \pmod{3}$, the only value left undetermined is N = 17. When $N \equiv 0 \pmod{3}$, a finite number of values of N remain, the largest being N = 2580. The techniques developed rely heavily on tools from combinatorial design theory.
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.inria.fr/inria-00429214
Contributor : David Coudert <>
Submitted on : Sunday, November 1, 2009 - 9:07:13 PM
Last modification on : Monday, September 9, 2019 - 1:42:09 PM
Long-term archiving on : Thursday, June 17, 2010 - 6:58:40 PM

File

BCC_-DM05.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, et al.. Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2005, 19 (2), pp.523-542. ⟨10.1137/S0895480104444314⟩. ⟨inria-00429214⟩

Share

Metrics

Record views

419

Files downloads

253