Title of article
Grooming in unidirectional rings: K4−e designs Original Research Article
Author/Authors
Jean-Claude Bermond، نويسنده , , Charles J. Colbourn، نويسنده , , Alan C.H. Ling، نويسنده , , Min-Li Yu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
57
To page
62
Abstract
In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength. The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electronic conversion. The determination of groomings to use the fewest multiplexers is equivalent to a graph design problem, which has been solved when up to four signals can be packed into a stream. We completely settle the case here when five signals pack into one stream, using old and new results on (K4−e)-designs.
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948952
Link To Document