A new approach for AntNet routing

AntNet is a new algorithm for packet routing in communication networks. It was first proposed by M. Dorigo and G. Di Care (1997). In AntNet, a group of mobile agents (artificial ants) build paths between pairs of nodes, exploring the network concurrently and exchanging data to update routing tables. This paper analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commercial algorithms like RIP (routing information protocol) and OSPF (open shortest path first). Simulation results indicate a better throughput (number of packets successfully routed per unit time) for the improved proposals. As for packet delay, the improved proposals bettered the original AntNet, although RIP and OSPF were unbeatable in this measure of performance. Due to the increase in the number of users in networks like the Internet, it may be expected that network service administrators will prioritize throughput to maximize services to a growing number of users. So, AntNet and its variant here proposed are promising options for routing in large public networks such as the Internet