# Grooming in unidirectional rings : $K_4 -e$ designs.

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Document type :
Journal articles
Domain :

https://hal.inria.fr/inria-00505518
Contributor : Jean-Claude Bermond <>
Submitted on : Friday, July 23, 2010 - 10:56:13 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

### Identifiers

• HAL Id : inria-00505518, version 1

### Citation

Jean-Claude Bermond, Charles J. Colbourn, Alan C H Ling, Min-Li Yu. Grooming in unidirectional rings : $K_4 -e$ designs.. Discrete Mathematics, Elsevier, 2004, 284 (1-3), pp.57-62. ⟨inria-00505518⟩

Record views