Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks

Abstract : In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k fibers per link and w wavelengths per fiber, generalization that we will call (k,w)-WAP. We develop a new model for the (k,w)-WAP based on conflict hypergraphs. Furthermore, we consider two natural optimization problems that arise from the (k,w)-WAP: minimizing the number of fibers k given a number of wavelengths w, on one hand, and minimizing w given k, on the other. We develop and analyze the practical performance of two methodologies based on hypergraph coloring.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00371107
Contributor : Hervé Rivano <>
Submitted on : Wednesday, May 27, 2009 - 5:41:54 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Document(s) archivé(s) le : Thursday, June 10, 2010 - 6:49:20 PM

File

RR-4244.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00371107, version 1

Collections

Citation

Afonso Ferreira, Stéphane Pérennes, A. W. Richa, Hervé Rivano, N. Stier Moses. Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommunication Systems, Springer Verlag (Germany), 2003, 24 (2), pp.123--138. ⟨hal-00371107⟩

Share

Metrics

Record views

477

Files downloads

153