Reaction-diffusion and ant-based load balancing of communication networks

Kybernetes

Volumn 31, Issue 5, 2002, Pages 667-681

  Adamatzky, Andrew ^a   Holland, Owen ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Cybernetics; Intelligence; Neural networks; Optimization

Indexed keywords

CYBERNETICS; DIFFUSION; DIFFUSION IN LIQUIDS; NEURAL NETWORKS; OPTIMIZATION;

CONTROL AGENT; DISTRIBUTED LOAD BALANCING; INTELLIGENCE; RANDOM WALK; REACTION DIFFUSION; SMART AGENTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036377482     PISSN: 0368492X     EISSN: None     Source Type: Journal    
DOI: 10.1108/03684920210428218     Document Type: Article

References (30)

1. Adamatzky, A. (1991), “Neural algorithm for constructing minimum spanning tree of a finite planar set”, Neural Networks World, Vol. 6, pp. 335–9.
2. Adamatzky, A. and Holland, O. (1997), “Swarm intelligence: representations and algorithms”, Proc. Int. Workshop on Distributed Artificial Intelligence and Multi-Agent Systems, St. Petersburg, Russia, pp. 13–22.
3. Adamatzky, A. and Holland, O. (1998), “Voronoi-like nondeterministic partition of a lattice by collectives of finite automata”, Mathl. Comput. Modelling, Vol. 28, pp. 73–93.
4. Adamatzky, A. and Tolmachiev, D. (1996), “Chemical processor for computation of Voronoi diagram”, Adv. Mater. Optics Electr., Vol. 6, pp. 191–6.
5. Ahuja, M. and Zhu, Y. (1989), “A distributed algorithm for minimum weight spanning tree based on echo algorithms”, Proc. Int. Conf. Distr. Computing Syst., pp. 2–8.
6. Aldous, D.J. (1990), “The random walk construction of uniform spanning trees and uniform labelled trees”, SIAM J. Disc. Math., Vol. 3, pp. 450–65.
7. Appleby, S. and Steward, S. (1994), “Mobile agents for control in telecommunications networks”, British Telecom Technology Journal, Vol. 12, pp. 104–13.
8. Beckers, R., Holland, O.E. and Deneuborg, J.L. (1994), “From local actions to global tasks: stigmergy and collective robotics”, in Brooks, R.A., Maes, P. (Eds), ALIFE IV: Proc. 4th Int. Workshop on the Synthesis and Stimulation of Living Systems, MIT Press, pp. 181–9.
9. Bonabeau, E., Henaux, F., Guerin, S., Snyers, D., Kuntz, P. and Theraukaz, G. (1998), Routing in telecommunication networks with “smart ant-like agents”, SFI Research Paper.
10. Broder, A. (1989), “Generating random spanning trees”, Proc. Symp. Foundations of Computer Sci., IEEE Press, New York, pp. 442–7.
11. Butrimenko, A.V. (1964), “On the search for optimal routes in changing graphs”, Izv. Akad. Nauk SSSR. Ser. Tekhn. Kibern., Vol. 6.
12. Chong, F. (1993), Analog techniques for adaptive routing on interconnection networks, M.I.T. Transit Note No. 14.
13. Colorni, A., Dorigo, M. and Maniezzo, V. (1991), “Distributed optimization by ant colonies”, in Varela, F., Bourgine, P. (Eds), Proc. of Europ. Conf. on Artificial Life, pp. 134–42.
14. Cook, S. and Rackoff, C. (1980), “Space lower bounds for maze threadability on restricted machines”, SIAM J Comput, Vol. 9, pp. 636–52.
15. Cybenko, G. (1989), “Load balancing for distribute memory multiprocessors”, J. Parallel Distr. Comput., Vol. 7, pp. 279–301.
16. Diekmann, R., Muthukrishnan, S. and Nayakkankuppam, V. (1997), “Engineering diffusive load balancing algorithms using experiments”, Lecture Notes in Computer Science, Vol. 1253, pp. 111–22.
17. Dorigo, M., Maniezzo, V. and Colorni, A. (1996), “The ant system: optimization by a colony of cooperating agents”, IEEE Trans. Syst. Man Cybern., Vol. 26, pp. 1–13.
18. Doyle, P. and Snell, J.L. (1984), Random Walks and Electrical Networks, Mathematical Association of America, Washington.
19. Gambardella, L.M. and Dorigo, M. (1995), “Ant-Q: a reinforcement learning approach to the travelling salesman problem”, Proc. of the 12th Int. Conf. on Machine Learning, pp. 252–60.
20. Helbing, D., Molnar, P. and Schweitzer, F. (1998), Computer simulations of pedestrians dynamics and trail formation.
21. Littman, M. and Boyan, J. (1993), A distributed reinforcement learning scheme for network routing, Carnegi Mellon University Computer Science Report CMU-CS-93-165.
22. Lyons, R. and Peres, Y. (1997), Probability on Trees and Networks (a book in progress, 1997); http://www.ma.huji.ac.il/peres/index.html
23. Marshall, G.F. and Tarassenko, L. (1993), “Robot path planning using VLSI resistive grids”, Proc. 3rd Int. Conf. Artificial Neural Networks, Brighton, UK, pp. 163–7.
24. Schoonderwoerd, R., Holland, O. and Bruten, J. (1997), “Ant-like agents for load balancing in telecommunication networks”, Proc. 1st Int. Conf. On Autonomous Agents, Marina del Rey, USA, pp. 209–16.
25. Schoonderwoerd, R., Holland, O., Bruten, J. and Rothkratz, L. (1996), “Ant-based load balancing in telecommunication networks”, Adaptive Behaviour, Vol. 5, pp. 169–207.
26. Stefanuk, V.L. (1971), “On mutual assistance in the collective of radio stations”, Information Transmission Problems, Vol. 7, pp. 103–7.
27. Stefanuk, V.L. (1997), “From multi-agent systems to collective behaviour”, Proc. of the Int. Workshop Distributed Artificial Intelligence and Multi-Agent Systems, St. Petersburg, Russia, pp. 223–4, 327–338.
28. Subramanian, D., Druschel, P. and Chen, J. (1997), “Ants and reinforcement learning: a case study in routing in dynamic networks”, Proc. IJCAI-97: Int. Joint Conf. AI, Morgan Kaufmann, pp. 832–8.
29. Tsetlin, M.L. (1973), Automaton Theory and Modelling of Biological Systems, Academic Press, New York.
30. Vergis, A., Steiglitz, K. and Dickinson, B. (1986), “The complexity of analog computation”, Mathematics and Computers in Simulation, Vol. 28, pp. 91–113.