Traffic Grooming in Bidirectional WDM Ring Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Traffic Grooming in Bidirectional WDM Ring Networks

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.
Fichier principal
Vignette du fichier
RR-7080.pdf (311.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00429155 , version 1 (31-10-2009)

Identifiers

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

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More