Graph Theory and Traffic Grooming in WDM Rings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2003

Graph Theory and Traffic Grooming in WDM Rings

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00429212 , version 1

Cite

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⟩
129 View
81 Download

Share

Gmail Facebook Twitter LinkedIn More