By Topic

Tabu search optimization in translucent network regenerator allocation

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
$31 $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

6 Author(s)
Zhaoyi Pan ; Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC ; Chatelain, B. ; Plant, D.V. ; Gagnon, F.
more authors

This paper introduces the Tabu Search optimization algorithm to solve the regenerator allocation problem in translucent networks. The problem consists of finding the minimum number of regenerator nodes which primarily affects the cost of the translucent network. The problem is first solved with an ILP formulation to find the optimal solution without taking into consideration its time performance. The optical reach limit due to the dispersion compensation module and full (static) traffic demand with a 1+1 protection scheme are considered in the network model. The proposed algorithm is then compared with two other heuristics: the maximum infeasibility reduction (MIR) algorithm and the maximum regeneration demand (MRD) algorithm. Numerical results show that the Tabu Search procedure either outperforms or equals the performance of the reference algorithms, while having a lower implementation complexity and comparable convergence speed.

Published in:

Broadband Communications, Networks and Systems, 2008. BROADNETS 2008. 5th International Conference on

Date of Conference:

8-11 Sept. 2008