Title :
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
Author :
Bhaskaran, Kavitha ; Triay, Joan ; Vokkarane, Vinod M.
Author_Institution :
Dept. of Comput. & Inf. Sci., Univ. of Massachusetts, Dartmouth, MA, USA
Abstract :
Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to perform better than simulated annealing and genetic algorithm approaches for solving dynamic problems. ACO algorithms can quickly adapt to real-time changes in the system. In this paper, we propose an ACO-based algorithm to solve the dynamic anycast routing and wavelength assignment (RWA) problem in wavelength-routed WDM networks. Using extensive simulations, we show that ACO-based anycast RWA significantly reduces blocking probability compared to the fixed shortest-path first (SPF) and other dynamic algorithms.
Keywords :
multicast communication; optimisation; probability; telecommunication network routing; wavelength assignment; wavelength division multiplexing; ACO algorithm; ACO-based anycast RWA; RWA problem; ant colony optimization; blocking probability; dynamic anycast routing and wavelength assignment; probabilistic technique; wavelength-routed WDM network; Complexity theory; Heuristic algorithms; Needles; Peer to peer computing; Routing; Wavelength assignment;
Conference_Titel :
Communications (ICC), 2011 IEEE International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-61284-232-5
Electronic_ISBN :
1550-3607
DOI :
10.1109/icc.2011.5962826