TSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networks

Date
2005
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the Conference on Optical Network Design and Modeling, IEEE 2005
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
2005
Issue
Pages
359 - 369
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
Abstract

Sparse wavelength conversion can increase the performance of all-optical wavelength division multiplexing (WDM) networks signi cantly by relaxing the wavelength continuity constraint. In this paper, we study the wavelength converter placement problem in multi- ber networks with static traf c demands. We present a tabu search based heuristic algorithm. The objective of the algorithm is to satisfy all the traf c demands with the minimum total cost of bers achieved in the full conversion case, by placing minimum number of wavelength converting nodes. We also implement a greedy algorithm and compare the performances of these converter placement algorithms with the optimum solutions on a sample network. The Tabu search based algorithm achieves the optimum solution in 72% of the test cases and it increases the average number of wavelength converting nodes by less than 10% with respect to the optimum solution. The effect of the utilized routing scheme on the generated solutions and the correlation between the converter node locations and the amount of traf c passing through the nodes are also investigated.

Course
Other identifiers
Book Title
Keywords
Greedy algorithms, Optical networks, Wavelength converters, Algorithms, Constraint theory, Heuristic methods, Optical communication, Problem solving, Telecommunication traffic, Wavelength division multiplexing
Citation
Published Version (Please cite this version)