A tabu search heuristic for the routing and wavelength assignment problem in optical networks

Author

Dzongang, Christiane ; Galinier, Philippe ; Pierre, Samuel

Author_Institution

Comput. Eng. Dept., Ecole Polytech. de Montreal, Que., Canada

Volume

9

Issue

5

fYear

2005

fDate

5/1/2005 12:00:00 AM

Firstpage

426

Lastpage

428

Abstract

This letter proposes a tabu search heuristic for solving the routing and wavelength assignment (RWA) problem in optical WDM networks, considering the wavelength continuity constraint and a given set of connections to satisfy. For a number of available wavelengths on each link, this algorithm attempts to maximize the number of routed connections. The algorithm has been implemented and tested on NSFNET and EONNET networks and comparisons have been done with other algorithms in terms of the blocking rate. Generally, the results obtained with our tabu search heuristic are better than those provided by these algorithms.

Keywords

channel allocation; optical fibre networks; search problems; telecommunication network routing; wavelength division multiplexing; EONNET network; NSFNET; RWA; optical WDM network; routing-wavelength assignment problem; tabu search heuristic algorithm; wavelength continuity constraint; wavelength division multiplexing; Bandwidth; IEEE members; Intelligent networks; Network topology; Optical design; Optical fiber networks; Telecommunication traffic; Testing; Wavelength assignment; Wavelength routing;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2005.05011

Filename

1431160