Research Article
Tabu Search Optimization in Translucent Network Regenerator Allocation
@INPROCEEDINGS{10.1109/BROADNETS.2008.4769153, author={Zhaoyi Pan and Beno\"{\i}t Ch\~{a}telain and David V. Plant and Fran\`{e}ois Gagnon and Christine Tremblay and \^{E}ric Bernier}, title={Tabu Search Optimization in Translucent Network Regenerator Allocation}, proceedings={5th International ICST Conference on Broadband Communications, Networks, and Systems}, publisher={IEEE}, proceedings_a={BROADNETS}, year={2010}, month={5}, keywords={Tabu search; translucent network; regenerator; optical reach limit; full traffic demand; 1+1 protection scheme.}, doi={10.1109/BROADNETS.2008.4769153} }- Zhaoyi Pan
Benoît Châtelain
David V. Plant
François Gagnon
Christine Tremblay
Éric Bernier
Year: 2010
Tabu Search Optimization in Translucent Network Regenerator Allocation
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2008.4769153
Abstract
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.