Performance Analysis of Peer-to-Peer Storage Systems

  • Sara Alouf
  • Abdulhalim Dandoush
  • Philippe Nain
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4516)


This paper evaluates the performance of two schemes for recovering lost data in a peer-to-peer (P2P) storage systems. The first scheme is centralized and relies on a server that recovers multiple losses at once, whereas the second one is distributed. By representing the state of each scheme by an absorbing Markov chain, we are able to compute their performance in terms of the delivered data lifetime and data availability. Numerical computations are provided to better illustrate the impact of each system parameter on the performance. Depending on the context considered, we provide guidelines on how to tune the system parameters in order to provide a desired data lifetime.


Peer-to-Peer systems performance evaluation absorbing Markov chain mean-field approximation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.M.: Total Recall: System support for automated availability management. In: Proc. of ACM/USENIX NSDI ’04, San Francisco, California, March 2004, pp. 337–350 (2004)Google Scholar
  2. 2.
    Blake, C., Rodrigues, R.: High availability, scalable storage, dynamic peer networks: Pick two. In: Proc. of HotOS-IX, Lihue, Hawaii, May 2003 (2003)Google Scholar
  3. 3.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. of ACM SOSP ’01, Banff, Canada, October 2001, pp. 202–215. ACM Press, New York (2001)Google Scholar
  5. 5.
    Farsite: Federated, available, and reliable storage for an incompletely trusted environment (2006),
  6. 6.
    Goldberg, A.V., Yianilos, P.N.: Towards an archival Intermemory. In: Proc. of ADL ’98, Santa Barbara, California, April 1998, pp. 147–156 (1998)Google Scholar
  7. 7.
    Grinstead, C., Snell, J.L.: Introduction to Probability. American Math. Soc.Google Scholar
  8. 8.
    Kleinrock, L.: Queueing Systems, Vol. 1. J. Wiley, Chichester (1975)Google Scholar
  9. 9.
    Kurtz, T.G.: Solutions of ordinary differential equations as limits of pure jump markov processes. Journal of Applied Probability 7(1), 49–58 (1970)zbMATHCrossRefGoogle Scholar
  10. 10.
    Lin, W.K., Chiu, D.M., Lee, Y.B.: Erasure code replication revisited. In: Proc. of IEEE P2P ’04, Zurich, Switzerland, August 2004, pp. 90–97. IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  11. 11.
    Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. An Algorithmic Approach. John Hopkins University Press, Baltimore (1981)zbMATHGoogle Scholar
  12. 12.
    Nurmi, D., Brevik, J., Wolski, R.: Modeling machine availability in enterprise and wide-area distributed computing environments. Technical Report CS2003-28, University of California Santa Barbara (2003)Google Scholar
  13. 13.
    The OceanStore project: Providing global-scale persistent data (2005),
  14. 14.
    Ramabhadran, S., Pasquale, J.: Analysis of long-running replicated systems. In: Proc. of IEEE INFOCOM ’06, Barcelona, Spain, April 2006, IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  15. 15.
    Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of SIAM 8(2), 300–304 (1960)zbMATHGoogle Scholar
  16. 16.
    Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc. of ACM SOSP ’01, Banff, Canada, October 2001, pp. 188–201. ACM Press, New York (2001)Google Scholar
  17. 17.
    Utard, G., Vernois, A.: Data durability in peer to peer storage systems. In: Proc. of IEEE GP2PC ’04, Chicago, Illinois, April 2004, IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  18. 18.
    Weatherspoon, H., Kubiatowicz, J.: Erasure coding vs. replication: A quantitative comparison. In: Proc. of IPTPS ’02, Cambridge, Massachusetts, March 2002 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sara Alouf
    • 1
  • Abdulhalim Dandoush
    • 1
  • Philippe Nain
    • 1
  1. 1.INRIA – B.P. 93 – 06902 Sophia AntipolisFrance

Personalised recommendations