On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube (original) (raw)

Abstract

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.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (11)

  1. R. Cox, A. Muthitacharoen, and R. T. Morris. Serving DNS Using a Peer-to-Peer Lookup Service. In Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems, 2002.
  2. D. Fahrenholtz and V. Turau. Improving Churn Resistance of P2P Data Stores Based on the Hypercube. In Proc. of the 5th Int'l Symposium on Parallel and Distributed Computing, 2006.
  3. D. Fahrenholtz, V. Turau, and A. Wombacher. Optimal Node Splits in Hypercube- based Peer-to-Peer Data Stores. Technical Report TR-2006-12-01, Hamburg Uni- versity of Technology, 2006.
  4. D. Fahrenholtz and V. Turau. A Tree-based DHT Approach to Scalable Weakly Consistent Data Management. In Proc. of the 1st Int'l Workshop on P2P Data Management, Security and Trust, 2004.
  5. I. Gupta, K. Birman, P. Linga, et al.. Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead. In Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems, 2003.
  6. F. S. Hillier and G. J. Lieberman. Introduction to Operations Research. 5th ed., McGraw-Hill Inc., 1990
  7. F. Kaashoek and D. Karger. Koorde: A simple Degree-optimal Hash Table. In Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems, 2003.
  8. Th. Locher, S. Schmid, and R. Wattenhofer. eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System. In Proc. of the 6th IEEE International Con- ference on Peer-to-Peer Computing, Cambridge, UK, 2006.
  9. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed Hashing in a Small World. In Proc. of the 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, 2003.
  10. S. Marti and H. Garcia-Molina. Taxonomy of Trust: Categorizing P2P Reputation Systems. Computer Networks 50(4): 472-484, 2006.
  11. S. Rhea, D. Geels, et al.. Handling Churn in a DHT. In Proc. of the USENIX Annual Technical Conference, Boston, MA, USA, 2004.