Stochastic analysis of the interplay between object maintenance and churn

Due to the prevalence of peer dynamics (i.e., churn), object maintenance becomes a fundamental issue in peer-to-peer storage systems. Although quite a few prototypes have been designed and implemented, they lack theoretical analysis to shed light on how the system evolves under churn and how to configure the system properly. The performance of peer-to-peer storage systems under churn (e.g., storage capacity, bandwidth usage, bandwidth spike, etc.) also become unclear. In this paper, we develop a simple model based on stochastic differential equations, with which we can analytically study the time-evolution of peer-to-peer storage systems under churn, and the interplay between object maintenance and churn. Different from previous Markovian analysis, we provide closed-form terms to capture the time-evolution of the storage system, and formally derive its related performance metrics under different maintenance strategies. Our analytical results provide valuable directions on the optimization of peer-to-peer storage systems, e.g., reducing bandwidth usage, provisioning for bandwidth spike, improving system capacity. Besides analytical studies, our theoretical results are also validated by extensive simulations.

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

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

[3]  Dmitri Loguinov,et al.  Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[4]  Rodrigo Rodrigues,et al.  Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[5]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Steven H. Strogatz,et al.  Nonlinear Dynamics and Chaos , 2024 .

[7]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[8]  Seif Haridi,et al.  A Statistical Theory of Chord Under Churn , 2005, IPTPS.

[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]  Ben Y. Zhao,et al.  Awarded Best Student Paper! - Pond: The OceanStore Prototype , 2003 .

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

[12]  J. Kubiatowicz,et al.  Long-Term Data Maintenance in Wide-Area Storage Systems : A Quantitative Approach , 2005 .

[13]  Stefan Saroiu,et al.  Measurement and analysis of internet content delivery systems , 2004 .

[14]  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).

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

[16]  Antony I. T. Rowstron,et al.  Squirrel: a decentralized peer-to-peer web cache , 2002, PODC '02.

[17]  Ira Pramanick,et al.  High Availability , 2001, Int. J. High Perform. Comput. Appl..

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

[19]  Peter Druschel,et al.  Storage management and caching in PAST , 2001 .

[20]  Keith W. Ross,et al.  A Measurement Study of a Large-Scale P2P IPTV System , 2007, IEEE Transactions on Multimedia.

[21]  Brian D. Noble,et al.  Exploiting Availability Prediction in Distributed Systems , 2006, NSDI.

[22]  Eli Upfal,et al.  Building low-diameter peer-to-peer networks , 2003, IEEE J. Sel. Areas Commun..

[23]  David Mazières,et al.  Rateless Codes and Big Downloads , 2003, IPTPS.

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

[25]  J. Thompson,et al.  Nonlinear Dynamics and Chaos , 2002 .

[26]  Ben Y. Zhao,et al.  Pond: The OceanStore Prototype , 2003, FAST.

[27]  Aravind Srinivasan,et al.  Resilient multicast using overlays , 2003, IEEE/ACM Transactions on Networking.

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

[29]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[30]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[31]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

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

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

[34]  Scott Shenker,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

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

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