Skip to Main content Skip to Navigation

Online Distributed Traffic Grooming on Path Networks

Jean-Claude Bermond 1 David Coudert 1, * Joseph Peters 2 
* Corresponding author
1 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
Abstract : The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is called traffic grooming. The goal of traffic grooming is either to reduce the transmission cost by reducing the number of wavelengths or to reduce the hardware cost by reducing the number of Add-Drop Multiplexors (ADM). In this paper, we investigate traffic grooming for directed path networks with online connection requests and distributed routing algorithms. When connection requests are online, the virtual topology that results from the assignment of ADMs to wavelengths cannot be changed with each request. The design of efficient virtual topologies that minimize either the number of ADMs needed to satisfy any set of connection requests or the blocking of connection requests depends strongly on the routing algorithm. We show how to design the best possible virtual topologies, independently of the routing algorithm, when each node is equipped with the same number of ADMs, and we analyze the performance of distributed greedy routing algorithms.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : David Coudert Connect in order to contact the contributor
Submitted on : Tuesday, March 17, 2009 - 1:08:26 AM
Last modification on : Thursday, August 4, 2022 - 4:52:41 PM
Long-term archiving on: : Saturday, November 26, 2016 - 6:36:10 AM


Files produced by the author(s)


  • HAL Id : inria-00359810, version 2



Jean-Claude Bermond, David Coudert, Joseph Peters. Online Distributed Traffic Grooming on Path Networks. [Research Report] RR-6833, INRIA. 2009. ⟨inria-00359810v2⟩



Record views


Files downloads