Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
452723 | Computer Networks | 2007 | 22 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
S.S. Dhillon, P. Van Mieghem,