Grooming in unidirectional rings : $K_4 -e$ designs. - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics Year : 2004

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

(1) , (2) , (3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
142-BCLY04-groomingK4-e.pdf (208.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00505518 , version 1 (08-11-2022)

Identifiers

  • HAL Id : inria-00505518 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More