Traffic Grooming: Combinatorial Results and Practical Resolutions.

Tibor Cinkler 1 David Coudert 2 Michele Flammini 3 Gianpiero Monaco 2, 3 Luca Moscardelli 3 Xavier Muñoz 4 Ignasi Sau 2, 4 Mordechai Shalom 5 Shmuel Zaks 6
1 BME-TMIT - Department of Telecommunications and Media Informatics
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
3 DI - Dipartimento di Informatica [Italy]
4 Applied Mathematics IV Department
5 Tel Hai Academic College
6 Department of Computer Science [Haifa]
Abstract : In an optical network using the wavelength division multiplexing (WDM) technology, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses $1/g$ of the bandwidth of the wavelength, we will say that the grooming factor is $g$. That means that on a given edge of the network we can groom (group) at most $g$ requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers (shortly ADM) used in the network (related to the cost of the nodes). Here, we first survey the main theoretical results obtained for different grooming factors on various topologies: complexity, (in)approximability, optimal constructions, approximation algorithms, heuristics, etc. Then, we give an ILP formulation for multilayer traffic grooming and present some experimental results.
keyword : WDM Networks Grooming ADM
Type de document :
Chapitre d'ouvrage
Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. 〈10.1007/978-3-642-02250-0〉
Liste complète des métadonnées
https://hal.inria.fr/inria-00530964
Contributeur : Gianpiero Monaco <>
Soumis le : dimanche 31 octobre 2010 - 16:07:36
Dernière modification le : lundi 23 avril 2018 - 10:52:05

Identifiants

Collections

UNICE | INRIA | I3S | UNIV-COTEDAZUR

Citation

Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, et al.. Traffic Grooming: Combinatorial Results and Practical Resolutions.. Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. 〈10.1007/978-3-642-02250-0〉. 〈inria-00530964〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

249

Contact


archive-ouverte@inria.fr