Performance analysis of the AntNet algorithm

A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of ant-routing algorithms. In this paper, we compare the performance of AntNet, an ant-routing algorithm, with Dijkstra’s shortest path algorithm. Our simulations show that the performance of AntNet is comparable to Dijkstra’s shortest path algorithm. Moreover, under varying traffic loads, AntNet adapts to the changing traffic and performs better than shortest path routing. Ó 2006 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: CN
• Authors: S. S. Dhillon, Piet Van Mieghem
• Keywords: Algorithm, CN 2007, Dijkstra’s Shortest Path, Routing Algorithms