Ants and Loops

  • Authors:
  • Geoffrey Canright

  • Affiliations:
  • -

  • Venue:
  • ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The question of routing loop formation is examined for a class of routing schemes based on "agents" or "ants". First the notion of loop existence is discussed for the general case of routing tables with multiple, weighted entries. A simple criterion is then found which ensures loop-free routing. This criterion accounts for previous results with agent-based routing. It is however not in general met by ant-based (stochastic) routing schemes. In this case I find probabilistic arguments which conclude that, for such schemes, loops will be unlikely to form, and, if formed, unlikely to persist.