TY - JOUR

T1 - Traffic grooming in unidirectional wavelength-division multiplexed rings with grooming ratio C = 6

AU - Bermond, Jean Claude

AU - Colbourn, Charles

AU - Coudert, David

AU - Ge, Gennian

AU - Ling, Alan C H

AU - Muñoz, Xavier

PY - 2005

Y1 - 2005

N2 - 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 1/6 of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number N of sites satisfies N ≡ 1 (mod 3), the determination is complete, and when N ≡ 2 (mod 3), the only value left undetermined is N = 17. When N ≡ 0 (mod 3), a finite number of values of N remain, the largest being W = 2580. The techniques developed rely heavily on tools from combinatorial design theory.

AB - 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 1/6 of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number N of sites satisfies N ≡ 1 (mod 3), the determination is complete, and when N ≡ 2 (mod 3), the only value left undetermined is N = 17. When N ≡ 0 (mod 3), a finite number of values of N remain, the largest being W = 2580. The techniques developed rely heavily on tools from combinatorial design theory.

KW - Block designs

KW - Combinatorial designs

KW - Group-divisible designs

KW - Optical networks

KW - Traffic grooming

KW - Wavelength-division multiplexing

UR - http://www.scopus.com/inward/record.url?scp=33646829777&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646829777&partnerID=8YFLogxK

U2 - 10.1137/S0895480104444314

DO - 10.1137/S0895480104444314

M3 - Article

AN - SCOPUS:33646829777

VL - 19

SP - 523

EP - 542

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -