PublisherIEEE Press. Institute of Electrical and Electronics Engineers
Rights accessRestricted access - publisher's policy
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 optical 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 load-balancing and dynamic algorithms.
CitationBhaskaran, K.; Triay, J.; Vokkarane, V.M. Dynamic anycast routing and wavelength assignment in WDM networks using ant colony optimization (ACO). A: IEEE International Conference on Communications (ICC). "2011 IEEE International Conference on Communications". Kyoto: IEEE Press. Institute of Electrical and Electronics Engineers, 2011, p. 1-6.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com