HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Traffic Grooming in Bidirectional WDM Ring Networks

Jean-Claude Bermond 1 Xavier Muñoz 2
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - 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.
Document type :
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download

Contributor : Ignasi Sau Valls Connect in order to contact the contributor
Submitted on : Saturday, October 31, 2009 - 7:40:08 PM
Last modification on : Friday, February 4, 2022 - 3:19:12 AM
Long-term archiving on: : Thursday, June 17, 2010 - 5:38:34 PM


Files produced by the author(s)


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



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



Record views


Files downloads