Skip to Main content Skip to Navigation
Conference papers

Traffic Grooming in Bidirectional WDM Ring Networks

Jean-Claude Bermond 1 David Coudert 1, * Xavier Munoz 2 Ignasi Sau Valls 1, 2
* Corresponding author
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 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00429168
Contributor : David Coudert <>
Submitted on : Sunday, November 1, 2009 - 1:55:48 PM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Thursday, June 17, 2010 - 6:53:46 PM

File

BCMS-ICTON-GRAAL06.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau Valls. 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⟩

Share

Metrics

Record views

358

Files downloads

250