Network measurement based redundancy model and maintenance in dynamic P2P storage systems

Peer-to-peer distributed storage systems aggregate the storage space of many peers spread over the Internet. Due to the dynamic and scalable nature of these systems, it is a challenging issue to access data in an available and reliable way through redundancy. Following the modeling methodology presented in [1], we present the stochastic model to analyze redundancy evolution of these systems under churn. Different from the previous work based on the average peer availability, the stochastic model can be applied into the practice based on both conditional probabilities (alpha, theta) which can be obtained from network probing easily. First, we apply the model to characterize the redundancy evolution of a fragment system with temporary churn. Then, we use an empirical trace and a synthetic trace to validate the model. Second, based on the characteristics of different churn from the both probabilities, we propose the redundancy maintenance strategy assisted by network sampling. Our simulations evaluate the performance of the strategy driven by empirical and synthetic traces.

[1]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[2]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[3]  Andreas Haeberlen,et al.  Proactive Replication for Data Durability , 2006, IPTPS.

[4]  Andreas Haeberlen,et al.  Efficient Replica Maintenance for Distributed Storage Systems , 2006, NSDI.

[5]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[6]  Don Rawlings,et al.  On the Reliability of an n-Component System , 2006 .

[7]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[8]  Joseph Pasquale,et al.  Analysis of Long-Running Replicated Systems , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Ravi Jain,et al.  An Experimental Study of the Skype Peer-to-Peer VoIP System , 2005, IPTPS.

[10]  Karl Aberer,et al.  Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[11]  Gang Wang,et al.  Churn Impact on Replicated Data Duration in Structured P2P Networks , 2008, 2008 The Ninth International Conference on Web-Age Information Management.

[12]  Geoffrey M. Voelker,et al.  On Object Maintenance in Peer-to-Peer Systems , 2006, IPTPS.

[13]  Antony I. T. Rowstron,et al.  PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[14]  Rodrigo Rodrigues,et al.  High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.

[15]  Joseph Pasquale,et al.  Durability of replicated distributed storage systems , 2008, SIGMETRICS '08.

[16]  Kam-Wing Ng,et al.  Stochastic analysis of the interplay between object maintenance and churn , 2008, Comput. Commun..

[17]  D. M. Chiu,et al.  Erasure code replication revisited , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[18]  Ernst W. Biersack,et al.  Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems , 2008, 2008 Eighth International Conference on Peer-to-Peer Computing.

[19]  Marvin Theimer,et al.  Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs , 2000, SIGMETRICS '00.

[20]  Minghua Chen,et al.  Queuing models for peer-to-peer systems , 2009, IPTPS.

[21]  Brighten Godfrey,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.