Cette page appartient aux archives web de l'EPFL et n'est plus tenue à jour.
This page belongs to EPFL's web archive and is no longer updated.

Ant Based Control (Schoonderwoerd)

In the ABC algorithm a number of agents called ants are continouisly exploring the graph of a telephone network from random starting points to random destinations. Here, nodes in the graph (switching points) have limited capacity and will reject calls if they are overloaded.
After the ants arrival at the destinations, the chosen route becomes reinforced as a function of its "length" (number of hops). This reinforcement is in turn used by the ants to probabilisticly a suitable route to their destination of choice.
Routing tables built up in this way can then be exploited by calls that deterministically choose the route with the highest value. Hereby, the capacity limit of every switch-board on its route is decreased, making this connection less favorable for passing ants.
Posted by Nicolaus Correll on Monday 7 February 2005 at 17:12