<abstract xmlns="http://www.w3.org/1999/xhtml"><p> This paper presents an attempt to solve the problem of choosing the best combination among the M combinations of shortest paths in optical translucent networks. Fixed routing algorithms demands a single route to each pair of nodes. The existence of multiple shortest paths to some pairs of nodes originates the problem of choose the shortest path which fits better the network requests. The algorithm proposed in this paper is an adaptation of Ant Colony Optimization (ACO) metaheuristic and attempt to define the set of routes that fits in an optimized way the network conditions, resulting in reduced number of blocked requests and better adjusted justice in route distribution. A performance evaluation is conducted in real topologies by simulations, and the proposed algorithm shows better performance between the compared algorithms.</p></abstract>

This paper presents an attempt to solve the problem of choosing the best combination among the M combinations of shortest paths in optical translucent networks. Fixed routing algorithms demands a single route to each pair of nodes. The existence of multiple shortest paths to some pairs of nodes originates the problem of choose the shortest path which fits better the network requests. The algorithm proposed in this paper is an adaptation of Ant Colony Optimization (ACO) metaheuristic and attempt to define the set of routes that fits in an optimized way the network conditions, resulting in reduced number of blocked requests and better adjusted justice in route distribution. A performance evaluation is conducted in real topologies by simulations, and the proposed algorithm shows better performance between the compared algorithms.

Ant Colony Optimization Applied to the Problem of Choosing the Best Combination among M Combinations of Shortest Paths in Transparent Optical Networks

Computing Department, Federal University of Piauí, Terezina, Piaui, Brazil

School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan

Journal of Artificial Intelligence and Soft Computing Research

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

This paper presents an attempt to solve the problem of choosing the best combination among the M combinations of shortest paths in optical translucent...

Ant Colony Optimization Applied to the Problem of Choosing the Best Combination among M Combinations of Shortest Paths in Transparent Optical Networks

Publié en ligne: 10 août 2016

Pages: 231 - 242

DOI: https://doi.org/10.1515/jaiscr-2016-0017

Mots clés
optical networks, routing, ant colony, simulation

© 2016

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Ant Colony Optimization Applied to the Problem of Choosing the Best Combination among M Combinations of Shortest Paths in Transparent Optical Networks

Publié en ligne: 10 août 2016

Pages: 231 - 242

DOI: https://doi.org/10.1515/jaiscr-2016-0017

Mots clésoptical networks, routing, ant colony, simulation

© 2016

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Mots clés
optical networks, routing, ant colony, simulation