Paper Info
Title
SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems
Abstract
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.
Year
DOI
Venue
2008
10.1109/EDCC-7.2008.17
EDCC
Keywords
Field
DocType
independent-dominating set,large-scale dynamic systems,localized portion,object holder,decentralized object deployment algorithm,h-hops neighborhood,different network topology,communication latency,self-organizing object deployment algorithm,ect load variation,theoretical analysis,sonde self-stabilizes,object recognition,self stabilization,convergence,dominating set,availability,algorithm design and analysis,network topologies,network topology,self organization,internet telephony,maximal independent set,servers,upper bound,dynamic system
Load management,Algorithm design,Peer-to-peer,Computer science,Correctness,Server,Algorithm,Network topology,Real-time computing,Self-stabilization,Distributed computing,Voice over IP
Conference
Citations 
PageRank 
References 
3
0.44
15
Authors
4
Name
Order
Citations
PageRank
Vincent Gramoli152939.08
Anne-Marie Kermarrec26649453.63
Erwan Le Merrer332223.58
Didier Neveux430.44