Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Book sections

Graph Theory and Traffic Grooming in WDM Rings

David Coudert 1 Xavier Munoz 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 : This paper has a double purpose. In the first part of the paper we give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results, but to give a flavor of how graph theory can help research in optical networks. The second part of this paper is a detailed example of the usage of graph theory, but it is also a complete survey of recent results in minimization of the number of add--drop multiplexers (ADMs) required in a WDM ring with traffic grooming.
Complete list of metadata

Cited literature [42 references]  Display  Hide  Download
Contributor : David Coudert Connect in order to contact the contributor
Submitted on : Sunday, November 1, 2009 - 8:17:01 PM
Last modification on : Saturday, June 25, 2022 - 11:02:44 PM
Long-term archiving on: : Thursday, June 17, 2010 - 6:58:18 PM


Files produced by the author(s)


  • HAL Id : inria-00429212, version 1



David Coudert, Xavier Munoz. Graph Theory and Traffic Grooming in WDM Rings. S.G. Pandalai. Recent Research Developments in Optics, 3, Research Signpost, pp.759-778, 2003, 81-271-0028-5. ⟨inria-00429212⟩



Record views


Files downloads