Optimal Node Splits in Hypercube-based Peer-to-Peer Data Stores

P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer population dynamics make them suitable for a wide range of application domains. This technical report presents and analyzes the split maintenance operation 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]  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).

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

[3]  Volker Turau,et al.  A tree-based DHT Approach to scalable weakly consistent peer-to-peer data management , 2004 .

[4]  Predrag Knezevic,et al.  A Self-organizing Data Store for Large Scale Distributed Infrastructures , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

[5]  André Heck,et al.  Introduction to Maple , 1993 .

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

[7]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[8]  Eric A. Brewer,et al.  USENIX Association Proceedings of HotOS IX : The 9 th Workshop on Hot Topics in Operating Systems , 2003 .

[9]  Daniel Stutzbach,et al.  Towards a Better Understanding of Churn in Peer-to-Peer Networks , 2004 .

[10]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

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

[12]  Pierre Sens,et al.  Implementation and performance evaluation of an adaptable failure detector , 2002, Proceedings International Conference on Dependable Systems and Networks.

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

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

[15]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[16]  Winfried Lamersdorf,et al.  Transactional Security for a Distributed Reputation Management System , 2002, EC-Web.

[17]  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.