Performance Analysis of Centralized versus Distributed Recovery Schemes in P2P Storage Systems

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


This paper studies the performance of Peer-to-Peer Storage Systems (P2PSS) in terms of data lifetime and availability. Two schemes for recovering lost data are modeled through absorbing Markov chains and their performance are evaluated and compared. The first scheme relies on a centralized controller that can recover multiple losses at once, whereas the second scheme is distributed and recovers one loss at a time. The impact of each system parameter on the performance is evaluated, and guidelines are derived on how to engineer the system and tune its key parameters in order to provide desired lifetime and/or availability of data. We find that, in stable environments such as local area or research laboratory networks where machines are usually highly available, the distributed-repair scheme offers a reliable, scalable and cheap storage/backup solution. This is in contrast with the case of highly dynamic environments, where the distributed-repair scheme is inefficient as long as the storage overhead is kept reasonable. P2PSS with centralized-repair scheme are efficient in any environment but have the disadvantage of relying on a centralized authority. Our analysis also suggests that the use of large size fragments reduces the efficiency of the recovery mechanism.


Performance evaluation peer-to-peer storage systems recovery process absorbing continuous-time Markov chain 


  1. 1.
    Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc. of ACM SOSP 2001, Banff, Canada, October 2001, pp. 188–201 (2001)Google Scholar
  2. 2.
    Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.: Total Recall: System support for automated availability management. In: Proc. of ACM/USENIX NSDI 2004, San Francisco, California, March 2004, pp. 337–350 (2004)Google Scholar
  3. 3.
    Ramabhadran, S., Pasquale, J.: Analysis of long-running replicated systems. In: Proc. of IEEE Infocom 2006, Barcelona, Spain (April 2006)Google Scholar
  4. 4.
    Stribling, J.: PlanetLab - All Pairs Pings (2005),
  5. 5.
    PlanetLab: An open platform for developing, deploying, and accessing planetary-scale services (2007),
  6. 6.
    Alouf, S., Dandoush, A., Nain, P.: Performance analysis of peer-to-peer storage systems. In: Mason, L.G., Drwiega, T., Yan, J. (eds.) ITC 2007. LNCS, vol. 4516, pp. 642–653. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Dandoush, A., Alouf, S., Nain, P.: Simulation analysis of download and recovery processes in P2P storage systems. Technical Report RR-6858, INRIA Sophia Antipolis (February 2009)Google Scholar
  8. 8.
    Reed, I., Solomon, G.: Polynomial codes over certain finite fields. Journal of SIAM 8(2), 300–304 (1960)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Harrison, P., Zertal, S.: Queueing models of RAID systems with maxima of waiting times. Performance Evaluation Journal 64(7-8), 664–689 (2007)CrossRefGoogle Scholar
  10. 10.
    Neuts, M.: Matrix Geometric Solutions in Stochastic Models. In: An Algorithmic Approach. John Hopkins University Press, Baltimore (1981)Google Scholar
  11. 11.
    Grinstead, C., Laurie Snell, J.: Introduction to Probability. American Mathematical Society, Providence (1997)zbMATHGoogle Scholar
  12. 12.
    Bhagwan, R., Savage, S., Voelker, G.: Understanding availability. In: Proc. of 2nd IPTPS, Berkeley, California (February 2003)Google Scholar
  13. 13.
    Guha, A., Daswani, N., Jain, R.: An experimental study of the skype peer-to-peer VoIP system. In: Proc. of 5th IPTPS, Santa Barbara, California (February 2006)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2009

Authors and Affiliations

  • Abdulhalim Dandoush
    • 1
  • Sara Alouf
    • 1
  • Philippe Nain
    • 1
  1. 1.INRIA Sophia AntipolisSophia AntipolisFrance

Personalised recommendations