Traffic Grooming: Combinatorial Results and Practical Resolutions. - Archive ouverte HAL Access content directly
Book Sections Year : 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.

(1) , (2) , (3) , (2, 3) , (3) , (4) , (2, 4) , (5) , (6)
1
2
3
4
5
6

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.

Keywords

Dates and versions

inria-00530964 , version 1 (31-10-2010)

Identifiers

Cite

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⟩
132 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More