On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube
Conference: KiVS 2007 - Kommunikation in Verteilten Systemen - 15. ITG/GI-Fachtagung
02/26/2007 - 03/02/2007 at Bern, Schweiz
Proceedings: KiVS 2007
Pages: 8Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Fahrenholtz, Dietrich; Turau, Volker (Hamburg University of Technology, Institute of Telematics, Germany)
Wombacher, Andreas (Swiss Federal Institute of Technology, Dist. Information Sys. Lab., Switzerland)
Abstract:
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 paper 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.