loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06)
Improving Churn Resistance of P2P Data Stores Based on the Hypercube
Timisoara, Romania
July 06-July 09
ISBN: 0-7695-2638-1
Dietrich Fahrenholtz, Hamburg University of Technology, Germany
Volker Turau, Hamburg University of Technology, Germany
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 fusion maintenance operation. It aims at reorganizing parts of our P2P data store in case the peer population shrinks so much that data availability is threatened. To this end, we present a formal cost model that peers use to estimate the optimal invocation point of a fusion. Finally, we present experimental results that validate our cost model by simulating various network conditions.
Citation:
Dietrich Fahrenholtz, Volker Turau, "Improving Churn Resistance of P2P Data Stores Based on the Hypercube," ispdc, pp.263-270, Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.