A tabu search algorithm for sparse placement of wavelength converting nodes in optical networks
Date
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Volume
Issue
Pages
Language
Type
Journal Title
Journal ISSN
Volume Title
Attention Stats
Usage Stats
views
downloads
Series
Abstract
All-optical Wavelength Division Multiplexing networks, providing extremely large bandwidths, are among the most promising solutions for the increasing need for high-speed data transport. In all-optical networks, data is transmitted solely in the optical domain along lightpaths from source to destination without being converted into the electronic form, and each lightpath is restricted to use the same wavelength on all the links along its path. This restriction is known as the wavelength continuity constraint. Optical wavelength conversion can increase the performance and capacity of optical networks by removing this restriction and relaxing the wavelength continuity constraint. However, optical wavelength conversion is a difficult and expensive technology. In this study, we analyze the problem of placing limited number of wavelength converting nodes in a multi- fiber network with static traffic demands. Optimum placement of wavelength converting nodes is an NP-complete problem. We propose a tabu search based heuristic algorithm for this problem. The objective of the algorithm is to achieve the performance of full wavelength conversion in terms of minimizing the total number of fibers used in the network by placing minimum number of wavelength converting nodes. Numerical results comparing the performance of the algorithm with the optimum solutions are presented. The proposed algorithm gives quite satisfactory results, it also has a relatively low computational complexity making it applicable to large scale networks.