Traffic Grooming in Bidirectional WDM Ring Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Traffic Grooming in Bidirectional WDM Ring Networks

Abstract

We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We insist on the statement of the problem, which had not been clearly stated before in the bidirectional case. Optimal solutions had not been found up to date. In particular, we study the case C = 2 and C = 3 (giving either optimal constructions or near-optimal solutions) and the case C = k(k+1)/2 (giving optimal decompositions for specific congruence classes of N). We state a general Lower Bound for all the values of C and N, and we improve this Lower Bound for C=2 and C=3 (when N=4t+3). We also include some comments about the simulation of the problem using Linear Programming.
Fichier principal
Vignette du fichier
BCMS-ICTON-GRAAL06.pdf (368.32 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00429168 , version 1 (01-11-2009)

Identifiers

Cite

Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau. Traffic Grooming in Bidirectional WDM Ring Networks. International Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.19 - 22, ⟨10.1109/ICTON.2006.248390⟩. ⟨inria-00429168⟩
108 View
125 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More