Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks - Archive ouverte HAL Access content directly
Journal Articles Telecommunication Systems Year : 2003

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.
Fichier principal
Vignette du fichier
RR-4244.pdf (350.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00371107 , version 1 (27-05-2009)

Identifiers

  • HAL Id : hal-00371107 , version 1

Cite

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, 2003, 24 (2), pp.123--138. ⟨hal-00371107⟩
198 View
159 Download

Share

Gmail Facebook Twitter LinkedIn More