Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring

Abstract : Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses at most 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) need two SONET add-drop multiplexers (ADMs) at each end node~; using grooming different requests can share the same ADM. The so called traffic grooming problem consists of minimizing the total number of ADMs to be used (in order to reduce the overall cost of the network). Here we consider the traffic grooming problem in WDM unidirectional rings with all-to-all uniform unitary traffic. This problem has been optimally solved for specific values of the grooming ratio, namely C=2,3,4,5,6. In this paper we present various simple constructions for the grooming problem providing good approximation of the total number of ADMs. For that we use the fact that the problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges and where the total number of vertices has to be minimized.
Type de document :
[Research Report] 2007, pp.11
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger
Contributeur : David Coudert <>
Soumis le : lundi 1 octobre 2007 - 13:48:29
Dernière modification le : mercredi 31 janvier 2018 - 10:24:04
Document(s) archivé(s) le : lundi 24 septembre 2012 - 12:56:11


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00175795, version 1



Jean-Claude Bermond, David Coudert, Benjamin Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. [Research Report] 2007, pp.11. 〈inria-00175795〉



Consultations de la notice


Téléchargements de fichiers