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.
Type de document :
Chapitre d'ouvrage
S.G. Pandalai. Recent Research Developments in Optics, 3, Research Signpost, pp.759-778, 2003, 81-271-0028-5
https://hal.inria.fr/inria-00429212
Contributeur : David Coudert
<>
Soumis le : dimanche 1 novembre 2009 - 20:17:01
Dernière modification le : dimanche 1 novembre 2009 - 21:58:46
Document(s) archivé(s) le : jeudi 17 juin 2010 - 18:58:18
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〉
