Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amin, K., Mikler, A.: Dynamic agent population in agent-based distance vector routing. In: Proc. of Intelligent Systems Design and Architecture (ISDA) (2002)
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)
Canright, G.: Ants and loops. In: Proceedings of Ants2002, pp. 235–242 (2002)
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)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of ACM SIGCOMM, pp. 251–262 (1999)
Di Caro, G., Dorigo, M.: AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA 97-12 (1997)
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)
Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research (JAIR) 9, 317–365 (1998)
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)
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)
Medina, A., Matta, I., Byers, J.: On the origin of power laws in internet topologies. ACM Computer Communications Review (2000)
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.
J. Montgomery and M. Randall. Anti-pheromone as a tool for better exploration of search space. Proceedings of Ants2002, pages 100–110, 2002.
J. Moy. RFC 2178, OSPF Specification Version 2. Network Working Group, July 1997.
K. Oida and A. Kataoka. Lock-free AntNets and their adaptability evaluations. Electronics and Communications in Japan (Part I: Communications), 84:51–61, 2000.
C. R. Palmer and J. G. Steffan. Generating network topologies that obey power laws. In Proceedings of the Global Internet Symposium, 2000.
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.
H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. ACM SIGCOMM, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doi, S., Yamamura, M. (2004). An Experimental Analysis of Loop-Free Algorithms for Scale-Free Networks. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive