An Experimental Analysis of Loop-Free Algorithms for Scale-Free Networks

Focusing on a Degree of Each Node
  • Shigeo Doi
  • Masayuki Yamamura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)


To use AntNet-FA globally, the ability of routing algorithms must be clear. The Internet has special topology and a hierarchy (AS and router). The topology have power-laws or scale-free property in other words. In this paper, we focused on the network topology and we applied AntNet algorithm to the network such as the Internet. We examined a node should use either a Loop-Free algorithm or a non-Loop-Free algorithm depending on its degree in heavy traffic condition. The Loop-Free feature means that when an ant decides to visit an adjacent node, then the ant selects the next node from its unvisited node. The non-Loop-Free algorithm is the same to the original AntNet. As a result, we found that network topology affects the ability of AntNet algorithms.


Network Topology Mobile Agent Border Gateway Protocol Network Metrics Internet Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amin, K., Mikler, A.: Dynamic agent population in agent-based distance vector routing. In: Proc. of Intelligent Systems Design and Architecture (ISDA) (2002)Google Scholar
  2. 2.
    Barabási, A., Albert, R., Jeong, H.: Scale-free characteristics of random networks: The topology of the world wide web. Physica A, 69–77 (2000)Google Scholar
  3. 3.
    Canright, G.: Ants and loops. In: Proceedings of Ants2002, pp. 235–242 (2002)Google Scholar
  4. 4.
    Eykelhof, C.J., Snoek, M.: Ant systems for a dynamic tsp - ants caught in a traffic jam. In: Proceedings of Ants2002, pp. 88–99 (2002)Google Scholar
  5. 5.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of ACM SIGCOMM, pp. 251–262 (1999)Google Scholar
  6. 6.
    Di Caro, G., Dorigo, M.: AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA 97-12 (1997)Google Scholar
  7. 7.
    Di Caro, G., Dorigo, M.: An adaptive multi-agent routing algorithm inspired by ants behaviour. In: Proceedings of PART 1998 - fifth Annual Australasian Conference on Parallel and Real-Time Systems (1998)Google Scholar
  8. 8.
    Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research (JAIR) 9, 317–365 (1998)zbMATHGoogle Scholar
  9. 9.
    Di Caro, G., Dorigo, M.: Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of PDCS 1998 - 10th International Conference on Parallel and Distributed Computing and Systems (1998)Google Scholar
  10. 10.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An approach to universal topology generation. In: Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems- MASCOTS 2001, 8 (2001)Google Scholar
  11. 11.
    Medina, A., Matta, I., Byers, J.: On the origin of power laws in internet topologies. ACM Computer Communications Review (2000)Google Scholar
  12. 12.
    N. Minar, K. H. Kramer, and P. Maes. Cooperating mobile agents for mapping networks. In Proceedings of the First Hungarian National Conference on Agent Based Computation, 1998. Google Scholar
  13. 13.
    J. Montgomery and M. Randall. Anti-pheromone as a tool for better exploration of search space. Proceedings of Ants2002, pages 100–110, 2002. Google Scholar
  14. 14.
    J. Moy. RFC 2178, OSPF Specification Version 2. Network Working Group, July 1997. Google Scholar
  15. 15.
    K. Oida and A. Kataoka. Lock-free AntNets and their adaptability evaluations. Electronics and Communications in Japan (Part I: Communications), 84:51–61, 2000. Google Scholar
  16. 16.
    C. R. Palmer and J. G. Steffan. Generating network topologies that obey power laws. In Proceedings of the Global Internet Symposium, 2000. Google Scholar
  17. 17.
    H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topologies, power laws, and hierarchy. Technical report, Computer Science Department, University of Southern Calfornia, 2001. Google Scholar
  18. 18.
    H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. ACM SIGCOMM, 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Shigeo Doi
    • 1
  • Masayuki Yamamura
    • 1
  1. 1.Interdisciplinary Graduate School of Science and EngineeringTokyo Institute of TechnologyYokohama-shi, Kanagawa-kenJapan

Personalised recommendations