Churn Impact on Replicated Data Duration in Structured P2P Networks

This paper analyzes churn impact on replicated data duration with different node lifetime distributions. In structured overlay networks, churn includes node-join churn and node-failure churn, caused by the arrival and departure of nodes separately. The paper introduces a duration model of replicated data under node-failure churn for node failure directly leads to data loss. Furthermore, it investigates the impact of node-join churn on the duration of replicated data for different node-lifetime distributions. The paper presents that node-churn will negatively impact on replicated data duration for heavy-tailed distribution and Weibull distribution except exponential distribution. Then we evaluate the impact on replicated data duration with two real-world trace datasets. The experimental results show the negative impact of node-join churn for different node-join churn degrees. Finally, the paper discusses an enhancement by setting a trial period for every fresh node. By experiment, it is an effective way to reduce the negative impact of node-join churn due to the memory property of node lifetime distributions.

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

[2]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

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

[4]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

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

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

[7]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[8]  Peng Huang,et al.  Stochastic Models in Reliability , 1999, Technometrics.

[9]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[10]  Andreas Haeberlen,et al.  Glacier: highly durable, decentralized storage despite massive correlated failures , 2005, NSDI.

[11]  Yoon-Hwa Choi,et al.  A Fault-Tolerant Bloom Filter for Deep Packet Inspection , 2007 .

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

[13]  KyoungSoo Park,et al.  CoMon: a mostly-scalable monitoring system for PlanetLab , 2006, OPSR.

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

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

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

[17]  Gang Wang,et al.  A Hybrid Redundancy Approach for Data Availability in Structured P2P Network Systems , 2007, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007).

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

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

[20]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

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