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

A. Ferreira, S. Pérennes, H. Rivano, Andrea Richa, N. Stier Moses

Research output: Contribution to journalArticle

12 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)123-138
Number of pages16
JournalTelecommunication Systems
Volume24
Issue number2-4
DOIs
StatePublished - Oct 2003

Fingerprint

Wavelength division multiplexing
Wavelength
Fibers
Coloring
Fiber optic networks

Keywords

  • Optical network design
  • Wavelength division multiplexing

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. / Ferreira, A.; Pérennes, S.; Rivano, H.; Richa, Andrea; Moses, N. Stier.

In: Telecommunication Systems, Vol. 24, No. 2-4, 10.2003, p. 123-138.

Research output: Contribution to journalArticle

Ferreira, A. ; Pérennes, S. ; Rivano, H. ; Richa, Andrea ; Moses, N. Stier. / Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. In: Telecommunication Systems. 2003 ; Vol. 24, No. 2-4. pp. 123-138.
@article{f05f8b62da9547448f8ad7d8cfa8f35c,
title = "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.",
keywords = "Optical network design, Wavelength division multiplexing",
author = "A. Ferreira and S. P{\'e}rennes and H. Rivano and Andrea Richa and Moses, {N. Stier}",
year = "2003",
month = "10",
doi = "10.1023/A:1026158611840",
language = "English (US)",
volume = "24",
pages = "123--138",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "2-4",

}

TY - JOUR

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

AU - Ferreira, A.

AU - Pérennes, S.

AU - Rivano, H.

AU - Richa, Andrea

AU - Moses, N. Stier

PY - 2003/10

Y1 - 2003/10

N2 - 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.

AB - 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.

KW - Optical network design

KW - Wavelength division multiplexing

UR - http://www.scopus.com/inward/record.url?scp=0347720923&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347720923&partnerID=8YFLogxK

U2 - 10.1023/A:1026158611840

DO - 10.1023/A:1026158611840

M3 - Article

AN - SCOPUS:0347720923

VL - 24

SP - 123

EP - 138

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 2-4

ER -