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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aguilar, J., Velásquez, L., Pool, M.: The Combinatorial Ant System. Applied Artificial Intelligence 18, 427–446 (2004)
Aguilar, J.: The Combinatorial Ant System for Dynamic Combinatorial Optimization Problems. Revista de Matematica: Teoria y Aplicaciones (to appear), Universidad de Costa Rica, San José, Costa Rica (2005)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: from Natural to Artificial Swarm Systems. Oxford University Press, Oxford (1999)
Corne, D., Dorigo, M., Glover, F.: New Ideas in Optimization. McGraw-Hill, New York (1999)
Dorigo, M., Maniezzo, V., Coloni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. of Systems, Man, Cybernetics 26, 29–41 (1996)
Dorigo, M., Gambardella, L.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. on Evol. Computation 1, 53–66 (1997)
Hidrobo, F., Aguilar, J.: Toward a Parallel Genetic Algorithm Approach Based on Collective Intelligence for Combinatorial Optimization Problems. In: Proc. of IEEE International Conference on Evolutionary Computation, pp. 715–720 (1998)
Mavromoustakis, C., Karatza, H.: Agent-Based Throughput Response in Presence of Node and/or Link Failure (on demand) for Circuit Switched Telecommunication Networks. Computer Communications 27, 230–238 (2004)
Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior 5, 169–207 (1997)
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)
Aguilar, J., Ramirez, W.: Some Results of CAS for Ad Hoc Networks", Technical Report, CEMISID, Facultad de Ingenieria, Universidad de los Andes (2004)
Appleby, S., Stewart, S.: Mobile Software Agents for Control in Telecommunication Networks. BT Technology Journals 12, 104–113 (1994)
Caro, G.D., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communication Networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)
Gabber, E., Smith, M.: Trail Blazer: A Routing Algorithm Inspired by Ants. In: Proc. of the 12th IEEE International Conference on Network Protocols (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aguilar, J., Labrador, M. (2005). A Fault Tolerant Distributed Routing Algorithm Based on Combinatorial Ant Systems. In: Huang, DS., Zhang, XP., Huang, GB. (eds) Advances in Intelligent Computing. ICIC 2005. Lecture Notes in Computer Science, vol 3644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538059_54
Download citation
DOI: https://doi.org/10.1007/11538059_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28226-6
Online ISBN: 978-3-540-31902-3
eBook Packages: Computer ScienceComputer Science (R0)