A number of routing algorithms based on the ant-colony metaphor have been proposed for communication netwroks. However, there has been little work on the performance analysis of ant-routing algorithms. In this paer, 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. Moerover, under varying traffic loads, AntNet adapts to the changin traffic and performs better than shortest routing paths.
- academic journal papers
- CWTS 0.75 <= JFIS < 2.00