Convergence Properties For Uniform Ant Routing

Abstract

We study the convergence property of a family of distributed routingalgorithms based on the ant colony metaphor, which generalize the uniform ant routing algorithms proposed earlier. For a simple two-node network, we show that the probabilistic routing tables under these algorithms converge in distribution, and discuss some of implementation issues.