A fault tolerant distributed routing algorithm based on combinatorial Ant systems

Abstract

In this paper, a general Combinatorial Ant System-based fault tolerant distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented. In the proposed algorithm, the solution space of the dynamic combinatorial optimization problem is mapped into the space where the ants will walk, and the transition probability and the pheromone update formula of the Ant System is defined according to the objective function of the communication problem. © Springer-Verlag Berlin Heidelberg 2005.