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.
Type de document :
Article dans une revue
Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2005, 19 (2), pp.523-542. <10.1137/S0895480104444314>
Liste complète des métadonnées

https://hal.inria.fr/inria-00429214
Contributeur : David Coudert <>
Soumis le : dimanche 1 novembre 2009 - 21:07:13
Dernière modification le : dimanche 1 novembre 2009 - 21:59:19
Document(s) archivé(s) le : jeudi 17 juin 2010 - 18:58:40

Fichier

BCC_-DM05.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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>

Partager

Métriques

Consultations de
la notice

239

Téléchargements du document

106