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.

• Type: Conference
• Year: 2008
• Where: EDCC
• Authors: Vincent Gramoli, Anne-Marie Kermarrec, Erwan Le Merrer
• Keywords: Applied Computing, Constant Upper Bound, EDCC 2008, Node, Object Deployment Algorithm