By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. Dzongang ; Comput. Eng. Dept., Ecole Polytech. de Montreal, Que., Canada ; P. Galinier ; S. Pierre

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.

Published in:

IEEE Communications Letters  (Volume:9 ,  Issue: 5 )