Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Artificial Intelligence and Soft Computing Research

The Journal of Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology

4 Issues per year

Open Access
See all formats and pricing
More options …

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

Ítalo Brasileiro
  • Corresponding author
  • Computing Department, Federal University of Piauí, Terezina, Piaui, Brazil
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Iallen Santos / André Soares / Ricardo Rabêlo / Felipe Mazullo
Published Online: 2016-08-10 | DOI: https://doi.org/10.1515/jaiscr-2016-0017


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.

Keywords: optical networks; routing; ant colony; simulation


  • [1] A. Kretsis, K. Christodoulopoulos, P. Kokkinos, and E. Varvarigos, Planning and operating flexible optical networks: Algorithmic issues and tools, Communications Magazine, IEEE, vol. 52, no. 1, pp. 61-69, 2014.Google Scholar

  • [2] A. Stavdas, T. Orphanoudakis, and A. Drakos, Qos performance benchmarking of networking paradigms in core networks, in European Conference and Exhibition on Optical Communication (ECOC)(Turin, Italy, 2010), 2010.Google Scholar

  • [3] I. G. S. Santos, G. Duraes, W. Giozza, A. Soares, and B. Catu, A new routing algorithm to choose the best among shortest paths (in portuguese), in SBRC - Brazilian Symposium on Computer Networks and Distributed Systems, 2012.Google Scholar

  • [4] P. Rajalakshmi and A. Jhunjhunwala, Load balanced routing to enhance the performance of optical backbone networks, in Wireless and Optical Communications Networks, 2008. WOCN’08. 5th IFIP International Conference on. - IEEE, 2008, pp. 1-5.Google Scholar

  • [5] G. M. Duraes, A. Soares, J. R. Amazonas, and W. Giozza, The choice of the best among the shortest routes in transparent optical networks, Computer Networks, vol. 54, no. 14, pp. 2400-2409, 2010.Google Scholar

  • [6] E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische mathematik, vol. 1, no. 1, pp. 269-271, 1959.Google Scholar

  • [7] A. Soares, W. Giozza, and P. Cunha, Classification strategy to mitigate unfairness in all-optical networks, in Networks, 2007. ICON 2007. 15th IEEE International Conference on. - IEEE, 2007, pp. 161-165.Google Scholar

  • [8] X. Wang, M. Brandt-Pearce, and S. Subramaniam, Distributed grooming, routing, and wavelength assignment for dynamic optical networks using ant colony optimization, Journal of Optical Communications and Networking, vol. 6, no. 6, pp. 578-589, 2014.Google Scholar

  • [9] F. C. Ergin, E. Kaldırım, A. Yayimli, and A. S. Uyar, Ensuring resilience in optical wdm networks with nature-inspired heuristics, Optical Communications and Networking, IEEE/OSA Journal of, vol. 2, no. 8, pp. 642-652, 2010.Google Scholar

  • [10] Y. Wang, J. Zhang, Y. Zhao, J. Wang, and W. Gu, Aco-based routing and spectrum allocation in flexible bandwidth networks, Photonic Network Communications, vol. 25, no. 3, pp. 135-143, 2013.Google Scholar

  • [11] M. Dorigo, M. Birattari, and T. Stutzle, Ant colony optimization, Computational Intelligence Magazine, IEEE, vol. 1, no. 4, pp. 28-39, 2006.Google Scholar

  • [12] M. Dorigo, E. Bonabeau, and G. Theraulaz, Ant algorithms and stigmergy, Future Generation Computer Systems, vol. 16, no. 8, pp. 851-871, 2000.Google Scholar

  • [13] A. P. Engelbrecht, Computational intelligence: an introduction. John Wiley & Sons, 2007.Google Scholar

  • [14] L. N. De Castro, Fundamentals of natural computing: basic concepts, algorithms, and applications. CRC Press, 2006.Google Scholar

  • [15] A. P. Engelbrecht, Fundamentals of computational swarm intelligence. John Wiley & Sons, 2006.Google Scholar

  • [16] L. Zhang, H. Chang, and R. Xu, Equal-width partitioning roulette wheel selection in genetic algorithm, in Technologies and Applications of Artificial Intelligence (TAAI), 2012 Conference on. IEEE, 2012, pp. 62-67.Google Scholar

  • [17] X. Chu, J. Liu, and Z. Zhang, Analysis of sparsepartial wavelength conversion in wavelengthrouted wdm networks, in INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, vol. 2. IEEE, 2004, pp. 1363-1371.Google Scholar

  • [18] A. Fontinele, I. Santos, G. Duraes, J. Maranhao, and A. Soares, Regenerator preventive allocation in translucent optical networks (in portuguese), in SBRC - Brazilian Symposium on Computer Networks and Distributed Systems, 2014, pp. 721-734.Google Scholar

About the article

Published Online: 2016-08-10

Published in Print: 2016-10-01

Citation Information: Journal of Artificial Intelligence and Soft Computing Research, Volume 6, Issue 4, Pages 231–242, ISSN (Online) 2083-2567, DOI: https://doi.org/10.1515/jaiscr-2016-0017.

Export Citation

© 2016. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. BY-NC-ND 4.0

Comments (0)

Please log in or register to comment.
Log in