A fault tolerant distributed routing algorithm based on combinatorial ant systems

Authors:
Jose Aguilar;Miguel Labrador
Affiliations:
CEMISID. Dpto. de Computación, Facultad de Ingeniería, Universidad de los Andes, Mérida, Venezuela;Department of Computer Science and Engineering, University of South Florida, Tampa, FL
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Year:
2005

Citing 9
Cited 0

Data networks

Data networks
Ant-based load balancing in telecommunications networks

Adaptive Behavior
Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
New ideas in optimization

New ideas in optimization
Trail Blazer: A Routing Algorithm Inspired by Ants

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Agent-based throughput response in presence of node and/or link failure (on demand) for circuit switched telecommunication networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.