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

Afonso Ferreira (1) , Stéphane Pérennes (1) , A. W. Richa (2) , Hervé Rivano (1) , N. Stier Moses (3)

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
2 CIDSE - Computer Science and Engineering [Tempe]
3 MIT - Massachusetts Institute of Technology

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.

Domaines: Réseaux et télécommunications [cs.NI]

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⟩