Design patterns from biology for distributed computing

ACM Transactions on Autonomous and Adaptive Systems

Volumn 1, Issue 1, 2006, Pages 26-66

  Babaoglu, Ozalp ^a   Canright, Geoffrey ^b   Deutsch, Andreas ^c   Di Caro, Gianni A ^d   Ducatelle, Frederick ^d   Gambardella, Luca M ^d   Ganguly, Niloy ^c   Jelasity, Márk ^a   Montemanni, Roberto ^d   Montresor, Alberto ^e   Urnes, Tore ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b TELENOR RESEARCH   (Norway)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^d DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^e UNIVERSITY OF TRENTO   (Italy)

Author keywords

Ad hoc networks; Bio inspiration; Distributed design patterns; Peer to peer; Self *

Indexed keywords

AD-HOC NETWORKS; BIOINSPIRATION; DISTRIBUTED DESIGN PATTERNS; PEER TO PEER NETWORKS;

INFORMATION TECHNOLOGY; LOGIC DESIGN; MOBILE COMPUTING; WIDE AREA NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748545258     PISSN: 15564665     EISSN: 15564703     Source Type: Journal    
DOI: 10.1145/1152934.1152937     Document Type: Conference Paper

References (83)

1. ABELSON, H., ALLEN, D., COORE, D., HANSON, C., HOMSY, G., THOMAS F. KNIGHT, J., NAGPAL, R., RAUCH, E., SUSSMAN, G. J., AND WEISS, R. 2000. Amorphous computing. Comm. ACM 43, 5 (May).
2. ADAMATZKY, A., DE LACY COSTELLO, B., AND ASAI, T. 2005. Reaction-Diffusion Computers. Elsevier.
3. ALBERT, R. AND BARABÁSI, A.-L. 2002. Statistical mechanics of complex networks. Rev. Modern Physics 74, 1 (Jan.), 47-97.
4. ALEXANDER, C. 1977. A Pattern Language: Towns, Buildings, Construction. Center for Environmental Structure Series. Oxford University Press.
5. ARBIB, M. A., ÉRDI, P., AND SZENTÁGOTHAI, J. 1997. Neural Organization: Structure, Function and Dynamics. MIT Press., Cambridge MA.
6. BAILEY, N. T. J. 1975. The Mathematical Theory of Infectious Diseases and Its Applications, 2nd ed. Griffin, London, UK.
7. BARAS, J. S. AND MEHTA, H. 2003. A probabilistic emergent routing algorithm for mobile ad hoc networks. In Proceedings of Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt'03).
8. BERTSEKAS, D. AND GALLAGER, R. 1992. Data, Networks. Prentice-Hall, Englewood Cliffs, NJ.
9. BETTSTETTER, C., RESTA, G., AND SANTI, P. 2003. The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mobile Comput. 2, 3, 257-269.
10. BOILLAT, J. 1990. Load balancing and poisson equation on a graph. Concurrency: Pract. Exper. 2, 280-313.
11. CAMAZINE, S., DENEUBOURG, J.-L., FRANKS, N. R., SNEYD, J., THERAULAZ, G., AND BONABEAU, E. 2001. Self-Organization in Biological Systems. Princeton University Pres, Princeton, NJ.
12. CANRIGHT, G., DEUTSCH, A., AND URNES, T. 2005. Chemotaxis-inspired load balancing. In Proceedings of the European Conference on Complex Systems (ECCS'05).
13. CHAWATHE, Y., RATNASAMY, S., BRESLAU, L., LANHAM, N., AND SHENKER, S. 2003. Making gnutella-like p2p systems scalable. In Proceedings of ACM SIGCOMM. ACM Press, 407-418.
14. CLAUSEN, T., JACQUET, P., LAOUITI, A., MUHLETHALER, P., QAYYUM, A., AND VIENNOT, L. 2001. Optimized link state routing protocol. In Proceedings of IEEE INMIC.
15. CYBENKO, G. 1989. Dynamic load balancing for distributed memory multiprocessors. J. Parall. Distribut. Comput. 7, 279-301.
16. DE CASTRO, L. N. AND TIMMIS, J. 2002. Artificial Immune Systeme. Springer Verlag, Berlin, Germany.
17. DEMERS, A., GREENE, D., HAUSER, C., IRISH, W., LARSON, J., SHENKER, S., STURGIS, H., SWINEHART, D., AND TERRY, D. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC'87). Vancouver, British Columbia, Canada. ACM Press, 1-12.
18. DEUTSCH, A., GANGULY, N., CANRIGHT, G., JELASITY, M., AND ENGØ-MONSEN, K. 2003. Models for advanced services in AHN, P2P networks. www.cs.unibo.it/bison/deliverables/D08.pdf.
19. DI CARO, G. A. 2003. Analysis of simulation environments for mobile ad hoc networks. Tech. Rep. 24-03 (Dec). IDSIA, Lugano, Switzerland.
20. Dl CARO, G. A. 2004. Ant colony optimization and its application to adaptive routing in telecommunication networks. Ph.D. thesis, Faculté des Sciences Appliquées, Université Libre de Bruxelles, Brussels, Belgium.
21. DI CARO, G. A. AND DORIGO, M. 1998. AntNet: Distributed stigmergetic control for communications networks. J. Artificial, Intelli. Res. 9, 317-365.
22. DO CARO, G. A., DUCATELLE, F., AND GAMBARDELLA, L. M. 2004. AntHocNet: An ant-based hybrid routing algorithm for mobile ad hoc networks. In Proceedings of Parallel Problem, Solving from Nature (PPSN) VIII. Lecture Notes in Computer Science, vol. 3242. Springer-Verlag, 461-470.
23. DI CARO, G. A., DUCATELLE, F., AND GAMBARDELLA, L. M. 2005a. AntHocNet: An adaptive natureinspired algorithm for routing in mobile ad hoc networks. European Trans. Telecomm. (Special Issue on Self-Organization in Mobile Networking) 16, 5 (Sept.-Oct.), 443-455.
24. DI CARO, G. A., DUCATELLE, F., AND GAMBARDELLA, L. M. 2005b. Swarm intelligence for routing in mobile ad hoc networks. In Proceedings of the IEEE Swarm Intelligence Symposium.
25. DI CARO, G. A., DUCATELLE, F., AND GAMBARDELLA, L. M. 2006. Studies of routing performance in a city-like testbed for mobile ad hoc networks. Tech. rep. 07-06 (March). IDSIA, Lugano, Switzerland.
26. DI MARZO SERUGENDO, G., KARAGEORGOS, A., RANA, O. F., AND ZAMBONELLI, F., EDS. 2004. Engineering self-organising systems. Lecture Notes in Artificial Intelligence, vol. 2977. Springer, Verlag, Berlin, Germany.
27. DORIGO, M., DI CARO, G. A., AND GAMBARDELLA, L. M. 1999. Ant algorithms for discrete optimization. Artificial Life 6, 2, 137-172.
28. DORIGO, M. AND STÜTZLE, T. 2004. Ant Colony Optimization. MIT Press, Cambridge, MA.
29. DUCATELLE, P., DI CARO, G. A., AND GAMBARDELLA, L. M. 2005b. Ant agents for hybrid multipath routing in mobile ad hoc networks. In Proceedings of the 2nd Annual Conference on Wireless on demand Network Systems and Services (WONS). St. Moritz, Switzerland.
30. DUCATELLE, F., DI CARO, G. A., AND GAMBARDELLA, L. M. 2005a. Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. Int. J. Computat. Intell. Appl. (Special Issue on Nature-Inspired Approaches to Networks and Telecommunications) 5, 2 (June), 169-184.
31. EIBEN, A. E. AND SMITH, J. E. 2003. Introduction to Evolutionary Computing. Springer Verlag, Berlin, Germany.
32. ELSÄSSER, R. AND MONIEN, B. 2003. Diffusion load balancing in static and dynamic networks. In Proceedings of the International Workshop on Ambient Intelligence Computing, 49-62.
33. FEWELL, J. H. 2003. Social insect networks. Science 301, 26 (Sept.), 1867-1869.
34. GAMMA, E., HELM, R., JOHNSON, R., AND VLISSIDES, J. 1995. Design Patterns. Addison-Wesley.
35. GANGULY, N., BRUSCH, L., AND DEUTSCH, A. 2005. Design and analysis of a bio-inspired search algorithm for peer to peer networks. In Self-Star Properties in Complex Information Systems. Lecture Notes in Computer Science, vol. 3460. Springer-Verlag, Berlin, Germany.
36. GANGULY, N., CANRIGHT, G., AND DEUTSCH, A. 2004a. Design of a robust search algorithm for p2p networks. In 11th International Conference on High Performance Computing.
37. GANGULY, N., CANRIGHT, G., AND DEUTSCH, A. 2004b. Design of an efficient search algorithm for p2p networks using concepts from natural immune systems. In 8th International Conference on Parallel, Problem Solving from Nature.
38. GANGULY, N. AND DEUTSCH, A. 2004a. A cellular automata model for immune based search algorithm. In 6th International Conference on Cellular Automata for Research and Industry.
39. GANGULY, N. AND DEUTSCH, A. 2004b. Developing efficient search algorithms for p2p networks using proliferation and mutation. In 3rd International Conference on Artificial Immune Systems.
40. GLAZIER, J. A. AND GRANER, F. 1993. Simulation of the differential adhesion driven rearrangement of biological cells. Phys. Rev. E 47, 3, 2128-2154.
41. GÜNES, M., KÄHMER, M., AND BOUAZIZI, I. 2003. Ant-routing-algorithm (ARA) for mobile multi-hop ad-hoc networks-new features and results. In Proceedings of the 2nd Mediterranean Workshop on Ad-Hoc Networks (Med-Hoc-Net'03). Mahdia, Tunisia.
42. H. VAN DYKE PARUNAK, S. B. 2004. Stigmergic learning for self-organizing mobile ad-hoc networks. In Proceedings of AAMAS,
43. HAAS, Z. J. 1997. A new routing protocol for the reconfigurable wireless networks. In Proceedings of the IEEE International Conference on Universal Personal Communications.
44. HAYKIN, S. 1998. Neural Networks: A Comprehensive Foundation, 2nd ed. Prentice Hall.
45. ILACHINSKI, A. 2001. Cellular Automata: A Discrete Universe. World Scientific.
46. JANEWAY, C. A., TRAVERS, P., WALPORT, M., AND SHLOMCHIK, M. 2001. Immuno Biology: The Immune System in Health and Disease, 5th ed. Garland Publishing.
47. JELASITY, M. AND BABAOGLU, O. 2005. T-Man: Gossip-based overlay topology management. In 3rd International Workshop on Engineering Self-Organising Applications (ESOA'05).
48. JELASITY, M., GUERRAOUI, R., KERMARREC, A.-M., AND VAN STEEN, M. 2004. The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In Middleware 2004, H.-A. Jacobsen, Ed. Lecture Notes in Computer Science, vol. 3231, Springer-Verlag, Berlin, Germany, 79-98.
49. JELASITY, M., MONTRESOR, A., AND BABAOGLU, O. 2004. A modular paradigm for building selforganizing peer-to-peer applications. In Engineering Self-Organising Systems, G. Di Marzo Serugendo, A. Karageorgos, O. F. Rana, and F. Zambonelli, Eds. Lecture Notes in Artificial Intelligence, vol. 2977. Springer-Verlag, Berlin, Germany, 265-282.
50. JELASITY, M., MONTRESOR, A., AND BABAOGLU, O. 2005. Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23, 3 (Aug.), 219-252.
51. JOHNSON, D. AND MALTZ, D. 1996. Mobile Computing. Kluwer (Chapter Dynamic Source Routing in Ad Hoc Wireless Networks). 153-181.
52. KEIL, D. AND GOLDIN, D. 2005. Adaptation and evolution in dynamic persistent environments. In Proceedings of the Workshop on the Foundations of Interactive Computation (FInCo'05). To appear in Electronic Notes in Theoretical Computer Science.
53. KEMPE, D., DOBRA, A., AND GEHRKE, J. 2003. Gossip-based computation of aggregate information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03). IEEE Computer Society, 482-491.
54. KEPHART, J. O. AND CHESS, D. M. 2003. The vision of autonomic computing. IEEE Comput. 36, 1 (Jan.), 41-50.
55. LANGTON, C. G., ED. 1997. Artificial Life: An Overview. MIT Press, Cambridge, MA.
56. LEE, D. L., CHUANG, H., AND SEAMONS, K. 1997. Document ranking and the vector-space model. IEEE Softw. 14, 2, 67-75.
57. LODDING, K. N. 2004. The hitchhiker's guide to biomorphic software. ACM Queue 2, 4, 66-75.
58. LV, Q., CAO, P., COHEN, E., AND SHENKER, S. 2002. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th ACM International Conference on Supercomputing.
59. MANKIN, R., ARBOGAST, R., KENDRA, P., AND WEAVER, D. 1999. Active spaces of pheromone traps for Plodia Interpunctella in enclosed environments. Environmen. Entomol. 28, 4, 557-565.
60. MONTEMANNI, R. AND GAMBARDELLA, L. 2005a. Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Compute. Oper. Resea. 32, 11 (Nov.), 2891-2904.
61. MONTEMANNI, R. AND GAMBARDELLA, L. 2005b. Power-aware distributed protocol for a connectivity problem in wireless sensor networks. In Self-Star Properties in Complex Information Systems. Lecture Notes in Computer Science, vol. 3460. Springer-Verlag, Berlin, Germany.
62. MONTEMANNI, R. AND GAMBARDELLA, L. 2005c. Swarm approach for a connectivity problem in wireless networks. In Proceedings of the IEEE Swarm Intelligence Symphosium, 265-272.
63. MONTEMANNI, R., GAMBARDELLA, L., AND DAS, A. 2006. Models and algorithms for the MPSCP: An overview. In Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, J. Wu, Ed. Auerbach Publications, 133-146.
64. MURRAY, J. D. 1990. Mathematical Biology. Springer-Verlag, Berlin, Germany.
65. OTTINO, J. M. 2004. Engineering complex systems. Nature 427, 399.
66. PARUNAK, H. V. D., BRUECKNER, S. A., SAUTER, J. A., AND MATTHEWS, R. 2005. Global convergence of local agent behaviors. In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'05). 305-312.
67. PEERSIM. http://peersim.sourceforge.net/.
68. PERKINS, C. AND ROYER, E. 1999. Ad-hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications.
69. PǍUN, G. 2002. Computing with Membranes: an Introduction. Springer, Verlag, Berlin, Germany.
70. PǍUN, G., ROZENBERG, G., AND SALOMAA, A. 2005. DNA Computing. Springer, Verlag, Berlin, Germany.
71. RISSON, J. AND MOORS, T. 2004. Survey of research towards robust peer-to-peer networks: Search methods. Tech. rep. UNSW-EE-P2P-1-1, (Sept.). University of New South Wales, Sydney, Australia.
72. ROYER, E. AND TOH, C.-K. 1999. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Person. Comm.
73. SCALABLE NETWORK TECHNOLOGIES, INC. 2005. QualNet Simulator, Version 3.8. Scalable Network Technologies, Inc., Culver City, CA, USA. http://www.scalable-networks.com.
74. SCHMIDT, D. C., JOHNSON, R. E., AND FAYAD, M. 1996. Guest editorial for the special issue on patterns and pattern languages. Comm. ACM 39, 10 (Oct.).
75. SCHOONDERWOERD, R., HOLLAND, O., BRUTEN, J., AND ROTHKRANTZ, L. 1996. Ant-based load balancing in telecommunications networks. Adaptive Behavior B, 2, 169-207.
76. SHEN, C.-C., JAIKAEO, C., SRISATHAPORNPHAT, C., HUANG, Z., AND RAJAGOPALAN, S. 2004. Ad hoc networking with swarm intelligence. In Proceedings of 4th International Workshop on Ant Algorithms. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany.
77. STAAB, S., HEYLIGHEN, F., GERSHENSON, C., FLAKE, G. W., PENNOCK, D. M., FAIN, D. C., DE ROURE, D., ABERER, K., SHEN, W.-M., DOUSSE, O., AND THIRAN, P. 2003. Neurons, viscose fluids, freshwater polyp hydra - and self-organizing information systems. IEEE Intelli. Syst. 18, 4, 72-86.
78. SUTTON, R. AND BARTO, A. 1998. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
79. THERAULAZ, G. AND BONABEAU, E. 1999. A brief history of stigmergy. Artificial Life, Special Issue on Stigmergy 5, 97-116.
80. VAN RENESSE, R. 2003. The importance of aggregation. Future Directions in Distributed Computing, A. Schiper, A. A. Shvartsman, H. Weatherspoon, and B. Y. Zhao, Eds. Lecture Notes in Computer Science, vol. 2584. Springer-Verlag, Berlin, Germany, 87-92.
81. VAN RENESSE, R., BIRMAN, K. P., AND VOGELS, W. 2003. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Sys. 21, 2 (May), 164-206.
82. YUSTE, S. B. AND ACEDO, L. 2000. Number of distinct sites visited by N random walkers on a Euclidean lattice. Physical Review E 61, 6327-34.
83. ZIPF, G. K. 1935. Psycho-Biology of Languages. Houghton-Mifflin, Boston, MA.