Performance analysis of the AntNet algorithm

  • Authors:

  • S. S. Dhillon;P. Van Mieghem

  • Affiliations:

  • Delft University of Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, P.O. Box 5031, 2600 GA Delft, The Netherlands;Delft University of Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, P.O. Box 5031, 2600 GA Delft, The Netherlands

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

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.