Skip to Main content Skip to Navigation
Book sections

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 Valls 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 , Laboratoire I3S - 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
Document type :
Book sections
Complete list of metadatas
https://hal.inria.fr/inria-00530964
Contributor : Gianpiero Monaco <>
Submitted on : Sunday, October 31, 2010 - 4:07:36 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM

Identifiers

Collections

UNICE | CNRS | 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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

320

 

Contact                    Legal Notice                    Personal Data