# Traffic Grooming in Bidirectional WDM Ring Networks

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 study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor $C$ and $N$, the size of the ring. We first study exhaustively the cases $C=1$, $C = 2$, and $C=3$, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case $C>3$, focusing specifically on the case $C = k(k+1)/2$ for some $k \geq 1$. We give optimal decompositions for several congruence classes of $N$ using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings.
Keywords :
Type de document :
Rapport
[Research Report] RR-7080, INRIA. 2009, pp.33
Domaine :

Littérature citée [35 références]

https://hal.inria.fr/inria-00429155
Contributeur : Ignasi Sau Valls <>
Soumis le : samedi 31 octobre 2009 - 19:40:08
Dernière modification le : mercredi 31 janvier 2018 - 10:24:04
Document(s) archivé(s) le : jeudi 17 juin 2010 - 17:38:34

### Fichiers

RR-7080.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00429155, version 1
• ARXIV : 0911.0140

### Citation

Jean-Claude Bermond, Xavier Muñoz. Traffic Grooming in Bidirectional WDM Ring Networks. [Research Report] RR-7080, INRIA. 2009, pp.33. 〈inria-00429155〉

### Métriques

Consultations de la notice

## 455

Téléchargements de fichiers