Advertisement

Replication Strategies for Highly Available Peer-to-Peer Storage

  • Ranjita Bhagwan
  • David Moore
  • Stefan Savage
  • Geoffrey M. Voelker
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2584)

Abstract

In the past few years, peer-to-peer networks have become an extremely popular mechanism for large-scale content sharing. Unlike traditional client-server applications, which centralize the management of data in a few highly reliable servers, peer-to-peer systems distribute the burden of data storage, computation, communications and administration among thousands of individual client workstations. While the popularity of this approach, exemplified by systems such as Gnutella [28.3], was driven by the popularity of unrestricted music distribution, newer work has expanded the potential application base to generalized distributed file systems [28.1], [28.4], persistent anonymous publishing [28.5], as well as support for high-quality video distribution [28.2]. The wide-spread attraction of the peer-to-peer model arises primarily from its potential for both low-cost scalability and enhanced availability. Ideally a peer-to-peer system could efficiently multiplex the resources and connectivity of its workstations across all of its users while at the same time protecting its users from transient or persistent failures in a subset of its components.

Keywords

Diurnal Pattern Replication Strategy Erasure Code Replica Placement USENIX Security Symposium 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 28.1
    F. Dabek, M. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with cfs. In proceedings of the 18th ACM Symposium on Operating System Principles (SOSP), 2001.Google Scholar
  2. 28.4
    J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS, 2000.Google Scholar
  3. 28.5
    A. D. R. MarcWaldman and L. F. Cranor. Publius: A robust, tamper-evident, censorshipresistant, web publishing system. In Proc. 9th USENIX Security Symposium, pages 59–72, August 2000.Google Scholar
  4. 28.6
    D. Moore. Caida analysis of code-red, http://www.caida.org/analysis/security/code-red/, 2001.
  5. 28.7
    V. Pless. Introduction to the theory of error-correcting codes. John Wiley and Sons, 3rd edition, 1998.Google Scholar
  6. 28.8
    S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In MMCN, 2002.Google Scholar
  7. 28.9
    I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, 2001.Google Scholar
  8. 28.10
    H. Weatherspoon and J. Kubiatowicz. Erasure coding v/s replication: a quantitative approach. In Proceedings of the First InternationalWorkshop on Peer-to-peer Systems, 2002.Google Scholar
  9. 28.11
    B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB-CSD-01-1141, U. C. Berkeley, April 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ranjita Bhagwan
    • 1
  • David Moore
    • 2
  • Stefan Savage
    • 2
  • Geoffrey M. Voelker
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of CaliforniaSan DiegoUSA
  2. 2.Department of Computer Science and EngineeringUniversity of CaliforniaSan DiegoUSA

Personalised recommendations