P2P storage systems modeling, analysis and evaluation

This Report characterizes the performance of peer-to-peer storage systems in terms of the delivered data lifetime and data availability. Two schemes for recovering lost data are modeled and analyzed: the first is centralized and relies on a server that recovers multiple losses at once, whereas the second is distributed and recovers one loss at a time. For each scheme, we propose a basic Markovian model where the availability of peers is exponentially distributed, and a more elaborate model where the latter is hyper-exponentially distributed. Our models equally apply to many distributed environments as shown through numerical computations. These allow to assess the impact of each system parameter on the performance. In particular, we provide guidelines on how to tune the system parameters in order to provide desired lifetime and/or availability of data. One important outcome of our analysis is that a simplifying exponential assumption on the peers availability leads to incorrect evaluation of the performance achieved. Thereby, the more elaborate model is necessary to capture the true behavior of peer-to-peer storage systems

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

[2]  Abdulhalim Dandoush,et al.  Performance Analysis of Peer-to-Peer Storage Systems , 2007, ITC.

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

[4]  Dah Ming Chiu,et al.  Erasure code replication revisited , 2004 .

[5]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[6]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

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

[8]  Andrew V. Goldberg,et al.  Towards an archival Intermemory , 1998, Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-.

[9]  Antoine Vernois,et al.  Data durability in peer to peer storage systems , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[10]  T. Kurtz Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

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

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

[13]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[14]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

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

[16]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[17]  Sheldon M. Ross Introduction to Probability Models. , 1995 .

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

[19]  Darrell D. E. Long,et al.  A longitudinal survey of Internet host reliability , 1995, Proceedings. 14th Symposium on Reliable Distributed Systems.

[20]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[21]  Richard Wolski,et al.  Modeling Machine Availability in Enterprise and Wide-Area Distributed Computing Environments , 2005, Euro-Par.

[22]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .