Skip Navigation



The Computer Journal Advance Access published online on March 31, 2008
The Computer Journal, doi:10.1093/comjnl/bxn017
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Saffre, F.
Right arrow Articles by Deneubourg, J. L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press on behalf of The British Computer Society.All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Aggregation Dynamics in Overlay Networks and Their Implications for Self-Organized Distributed Applications

Fabrice Saffre1,*, Richard Tateson1, José Halloy2, Mark Shackleton1 and Jean Louis Deneubourg2

1 BT Group CTO, Pervasive ICT Research Centre, Adastral Park, Orion 1st floor pp 12, Martlesham Heath IP5 3RE, UK
2 Université libre de Bruxelles, Service d'Ecologie Sociale and Centre for Nonlinear Phenomena and Complex Systems, Campus de la Plaine CP 231, Blvd. du Triomphe, 1050 Bruxelles, Belgium

* Corresponding author: fabrice.saffre{at}bt.com

Received 13 October 2006; revised 25 February 2008

In this paper, we investigate the global self-aggregation dynamics arising from local decision-based rewiring of an overlay network, used as an abstraction for an autonomic service-oriented architecture. We measure the ability of a selected set of local rules to foster self-organization of what is originally a random graph into a structured network. Scalability issues with respect to the key parameters of system size and diversity are extensively discussed. Conflicting goals are introduced, in the form of a population of nodes actively seeking to acquire neighbours of a type different from their own, resulting in decreased local homogeneity. We show that a ‘secondary’ self-organization process ensues, whereby nodes spontaneously cluster according to their implicit objective. Finally, we introduce dynamic goals by making the preferred neighbour type a function of the local characteristics of a simulated workload. We demonstrate that in this context, an overlay rewiring process based purely on local decisions and interactions can result in efficient load-balancing without central planning. We conclude by discussing the implications of our findings for the design of future distributed applications, the likely influence of other factors and of extreme parameter values on the ability of the system to self-organize and the potential improvements to our framework.

Key Words: self-organization • autonomic systems • overlay networks • distributed applications • component aggregation


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.