TY - GEN

T1 - Models, complexity and algorithms for the design of multifiber WDM networks

AU - Ferreira, A.

AU - Pérennes, S.

AU - Richa, A. W.

AU - Rivano, H.

AU - Stier Moses, N.

N1 - Publisher Copyright:
© 2003 IEEE.

PY - 2003

Y1 - 2003

N2 - We study multifiber optical networks with wavelength division multiplexing (WDM). Assuming that the lightpaths use the same wavelength from source to destination, we extend the definition of the well-known wavelength assignment problem (WAP), to the case where there are k fibers per link, and w wavelengths per fiber are available: This generalization is called the (k, ω)-WAP. We develop a new model for the (k, ω)-WAP, based on conflict hypergraphs: conflict hypergraphs more accurately capture the lightpath interdependencies, generalizing the conflict graphs used for single-fiber networks. By relating the (k, ω)-WAP with the hypergraph coloring problem, we prove that the former is NP-complete, and present further results with respect to the complexity of that problem. We consider the two natural optimization problems that arise from the (k, w)-WAP: the problem of minimizing k given w, and that of minimizing w given k. We develop and analyze the practical performances of two methodologies based on hypergraph coloring, one for each of the two optimization problems, on existing backbone networks in Europe and in the USA. The first methodology relies on two heuristics based on a randomized approximation algorithm and the second consists on an integer programming formulation.

AB - We study multifiber optical networks with wavelength division multiplexing (WDM). Assuming that the lightpaths use the same wavelength from source to destination, we extend the definition of the well-known wavelength assignment problem (WAP), to the case where there are k fibers per link, and w wavelengths per fiber are available: This generalization is called the (k, ω)-WAP. We develop a new model for the (k, ω)-WAP, based on conflict hypergraphs: conflict hypergraphs more accurately capture the lightpath interdependencies, generalizing the conflict graphs used for single-fiber networks. By relating the (k, ω)-WAP with the hypergraph coloring problem, we prove that the former is NP-complete, and present further results with respect to the complexity of that problem. We consider the two natural optimization problems that arise from the (k, w)-WAP: the problem of minimizing k given w, and that of minimizing w given k. We develop and analyze the practical performances of two methodologies based on hypergraph coloring, one for each of the two optimization problems, on existing backbone networks in Europe and in the USA. The first methodology relies on two heuristics based on a randomized approximation algorithm and the second consists on an integer programming formulation.

KW - Algorithm design and analysis

KW - Approximation algorithms

KW - Europe

KW - Optical fiber networks

KW - Optimization methods

KW - Performance analysis

KW - Spine

KW - WDM networks

KW - Wavelength assignment

KW - Wavelength division multiplexing

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

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

U2 - 10.1109/ICTEL.2003.1191150

DO - 10.1109/ICTEL.2003.1191150

M3 - Conference contribution

AN - SCOPUS:33846283683

T3 - 10th International Conference on Telecommunications, ICT 2003

SP - 12

EP - 18

BT - 10th International Conference on Telecommunications, ICT 2003

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 10th International Conference on Telecommunications, ICT 2003

Y2 - 23 February 2003 through 1 March 2003

ER -