Self-aggregation algorithms for autonomic systems

One of the today issues in software engineering is to find new effective ways to deal intelligently with the increasing complexity of distributed computing systems. In particular, one of the aspects under study in the field of autonomic computing concerns the way such systems can autonomously reach a configuration that allows the entire system to work in a more efficient and effective way. In this paper we investigate how it is possible to obtain self-aggregation of distributed components. We have used existing self-aggregation algorithms as a starting point, and, after an analysis phase, we have discovered some aspects that could be improved. Finally we have derived new algorithms that showed improved self-aggregating performances in most of the situations.

[1]  J. Deneubourg,et al.  Optimality of collective choices: A stochastic approach , 2003, Bulletin of mathematical biology.

[2]  John Strassner,et al.  Bio-inspired Policy Based Management (bioPBM) for Autonomic Bio-inspired Policy Based Management (bioPBM) for Autonomic , 2006, Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06).

[3]  Christian Bettstetter,et al.  Self-organization in communication networks: principles and design paradigms , 2005, IEEE Communications Magazine.

[4]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[5]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.

[6]  Xiaobo Tan,et al.  A Stochastic Algorithm for Self-Organization of Autonomous Swarms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  P. Sopp.  Cluster analysis. , 1996, Veterinary immunology and immunopathology.

[8]  Shlomi Dolev,et al.  Self-stabilizing and Self-organizing Distributed Algorithms , 2006 .

[9]  Chris Roadknight,et al.  Autonomic Computing for Pervasive ICT — A Whole-System Perspective , 2004 .

[10]  Hein Meling,et al.  Messor: Load-Balancing through a Swarm of Autonomous Agents , 2002, AP2PC.

[11]  R Ghanea-Hercock,et al.  Simple Laws for Complex Networks , 2003 .

[12]  Achim Rettinger,et al.  Intelligent exploration for genetic algorithms: using self-organizing maps in evolutionary computation , 2008, GECCO '05.

[13]  Jean-Louis Deneubourg,et al.  From local actions to global tasks: stigmergy and collective robotics , 2000 .

[14]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[15]  Mauro Leoncini,et al.  The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks , 2003, MobiHoc '03.

[16]  Guy Theraulaz,et al.  Self-Organization in Biological Systems , 2001, Princeton studies in complexity.

[17]  Wei-Min Shen,et al.  Hormone-inspired adaptive communication and distributed control for CONRO self-reconfigurable robots , 2002, IEEE Trans. Robotics Autom..

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[19]  Raffaela Mirandola,et al.  Self-organization algorithms for autonomic systems in the SelfLet approach , 2007, AUTONOMICS 2007.

[20]  Brian Everitt,et al.  Cluster analysis , 1974 .

[21]  J. Deneubourg,et al.  Probabilistic behaviour in ants: A strategy of errors? , 1983 .

[22]  Salima Hassas,et al.  Self-Organisation: Paradigms and Applications , 2003, Engineering Self-Organising Systems.