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

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , 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.
Type de document :
Article dans une revue
Discrete Mathematics, Elsevier, 2004, 284 (1-3), pp.57-62
Domaine :

https://hal.inria.fr/inria-00505518
Contributeur : Jean-Claude Bermond <>
Soumis le : vendredi 23 juillet 2010 - 22:56:13
Dernière modification le : mercredi 16 mars 2011 - 15:27:25

### Identifiants

• 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>

### Métriques

Consultations de la notice