SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems

We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data), SONDe provides a node with a constant upper bound (h) on the number of logical hops to access an object holder (provider), thus making tunable and predictable the communication latency between a node and any provider. In addition, SONDe is able to dynamically adapt the number of providers to reflect load variations experienced in localized portions of the system. Each node individually decides to be a provider, based on the observation of its h-hops neighborhood. We show theoretically that SONDe self-stabilizes and provides an independent-dominating set of providers. Finally simulation results, conducted over different network topologies, demonstrate the efficiency of the approach and confirm the theoretical analysis.

[1]  Paola Alimonti.  Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT , 1997, WG.

[2]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[3]  Roger Wattenhofer,et al.  Efficient computation of maximal independent sets in unstructured multi-hop radio networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[4]  Lujun Jia,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002, Distributed Computing.

[5]  Tiziana Calamoneri,et al.  Improved Approximations of Independent Dominating Set in Bounded Degree Graphs , 1996, WG.

[6]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[9]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[10]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[11]  Anne-Marie Kermarrec,et al.  Network awareness and failure resilience in self-organizing overlay networks , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[12]  Kang G. Shin,et al.  Self-Organizing Network Services , 1999 .

[13]  George H. L. Fletcher,et al.  Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance , 2004, AP2PC.

[14]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[15]  Anne-Marie Kermarrec,et al.  Energy aware self-organizing density management in wireless sensor networks , 2006, MobiShare '06.

[16]  Cullen Jennings,et al.  SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System , 2005, First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05).

[17]  Henning Schulzrinne,et al.  Peer-to-peer internet telephony using SIP , 2005, NOSSDAV '05.

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[19]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[20]  Xiuqi Li,et al.  'Dominating-set-based' searching in peer-to-peer networks , 2005, Int. J. High Perform. Comput. Netw..