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. © 2004 Springer-Verlag.
CITATION STYLE
Doi, S., & Yamamura, M. (2004). An experimental analysis of Loop-Free algorithms for scale-free networks: Focusing on a degree of each node. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 278–285). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_25
Mendeley helps you to discover research relevant for your work.