Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case

Jean-Claude Bermond 1 David Coudert 1 Xavier Munoz 2
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 : We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges (where C is the grooming ratio) and where the total number of vertices has to be minimized. Using tools of graph and design theory, we optimally solve the problem for practical values and infinite congruence classes of values for a given C . Among others, we give optimal constructions when C ≥ N (N − 1)/6 and results when C = 12. We also show how to improve lower bounds by using refined counting techniques, and how to use efficiently an ILP program by restricting the search space.
Type de document :
Communication dans un congrès
7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. IFIP TC6, pp.1135-1153, 2003
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00429175
Contributeur : David Coudert <>
Soumis le : dimanche 1 novembre 2009 - 14:58:12
Dernière modification le : lundi 23 avril 2018 - 10:52:05
Document(s) archivé(s) le : jeudi 17 juin 2010 - 18:54:44

Fichier

BCM-ONDM03.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00429175, version 1

Collections

Citation

Jean-Claude Bermond, David Coudert, Xavier Munoz. Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case. 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. IFIP TC6, pp.1135-1153, 2003. 〈inria-00429175〉

Partager

Métriques

Consultations de la notice

304

Téléchargements de fichiers

104