A Tabu Search Algorithm for Sparse Placement of Wavelength Converters in Optical Networks

Abstract

Abstract. In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu search based heuristic algorithm. 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. We also present a greedy algorithm and compare its performance with the tabu search algorithm. Finally, we present numerical results that demonstrate the high correlation between placing a wavelength converting node and the amount of transit traffic passing through that node.

Routing and wavelength converter allocation in WDM networks: a multi-objective evolutionary optimization approach

“…In a static traffic context, several approaches were proposed: simple heuristics [14,28,39,43,66,71], Linear Programming [22,46,61], Approximation Algorithms [45], and Tabu Search [47]. These works studied the relation between the number of converters and other parameters such as the number of wavelengths per optical fibre [14,28,43,66] and the number of optical fibres per link [39].…”

Multi-objective routing and wavelength converter allocation under uncertain traffic

“…In a static traffic context, several approaches were proposed: simple heuristics [20,[84][85][86][87][88], linear programming [3,89,90], approximation algorithms [91], and Tabu Search [92]. These works studied the relation between the number of converters and other parameters such as the number of wavelengths per optical fibre [84][85][86][87], and the number of optical fibres per link [20].…”