On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube

P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer pop- ulation dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the split maintenance opera- tion of our P2P data store. The operation aims at reorganizing replication groups in case operation of them becomes sub-optimal. To this end, we present a formal cost model that peers use to compute optimal points when to run performance optimizing maintenance. Finally, we present experimental results that validate our cost model by simulating various network conditions.

[1]  Hector Garcia-Molina,et al.  Taxonomy of trust: Categorizing P2P reputation systems , 2006, Comput. Networks.

[2]  Robert Tappan Morris,et al.  Serving DNS Using a Peer-to-Peer Lookup Service , 2002, IPTPS.

[3]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[4]  Dietrich Fahrenholtz.  Optimal Node Splits in Hypercube-based Peer-to-Peer Data Stores , 2006 .

[5]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[6]  R. Faure,et al.  Introduction to operations research , 1968 .

[7]  Volker Turau,et al.  Improving Churn Resistance of P2P Data Stores Based on the Hypercube , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.

[8]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[9]  Stefan Schmid,et al.  eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).