A Fixed-Parameter Tractable Algorithm for the Wavelength Assignment in WDM Mesh Networks

The assignment of wavelengths to lightpaths in WDM networks is a crucial problem that needs to be solved efficiently. However, the coloring of the graph representing the lightpaths and their interference is an NP-hard problem. The parameterized Complexity Theory offers an attractive theoretical fram...

Full description

Saved in:
Bibliographic Details
Published in:IEEE International Conference on Communications (2003) pp. 181 - 185
Main Authors: Drummond, A.C., da Fonseca, N.L.S., Gyurek, R.
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2008
Subjects:
Complexity theory
Computer networks
Mesh networks
Optical fiber networks
Optical wavelength conversion
Resource management
Wavelength assignment
Wavelength division multiplexing
Wavelength routing
WDM networks
ISSN:1550-3607
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The assignment of wavelengths to lightpaths in WDM networks is a crucial problem that needs to be solved efficiently. However, the coloring of the graph representing the lightpaths and their interference is an NP-hard problem. The parameterized Complexity Theory offers an attractive theoretical framework for the derivation of exact solutions with lower complexity than those derived using the Classical Complexity Theory since it transfers the exponentiality dependence from the input parameters describing the network to a parameter called modulator which can be bounded. This paper presents an algorithm for wavelength assignment in transparent WDM networks. Numerical examples illustrate the benefits of the employment of this new theory for the solution of the wavelength assignment problem.
ISSN:1550-3607
DOI:10.1109/ICC.2008.41