Erasure Coding Vs. Replication: A Quantitative Comparison

  • Hakim Weatherspoon
  • John D. Kubiatowicz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)

Abstract

Peer-to-peer systems are positioned to take advantage of gains in network bandwidth, storage capacity, and computational resources to provide long-term durable storage infrastructures. In this paper, we quantitatively compare building a distributed storage infrastructure that is self-repairing and resilient to faults using either a replicated system or an erasure-resilient system. We show that systems employing erasure codes have mean time to failures many orders of magnitude higher than replicated systems with similar storage and bandwidth requirements. More importantly, erasure-resilient systems use an order of magnitude less bandwidth and storage to provide similar system durability as replicated systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    ANDERSON, R. The eternity service. In Proceedings of Pragocrypt (1996).Google Scholar
  2. [2]
    BOLOSKY, W., DOUCEUR, J., ELY, D., AND THEIMER, M. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. of Sigmetrics (June 2000).Google Scholar
  3. [3]
    CHEN, Y., EDLER, J., GOLDBERG, A., GOTTLIEB, A., SOBTI, S., AND YIANILOS, P. Prototype implementation of archival intermemory. In Proc. of IEEE ICDE (Feb. 1996), pp. 485–495.Google Scholar
  4. [4]
    CLARK, I., SANDBERG, O., WILEY, B., AND HONG, T. Freenet: A distributed anonymous information storage and retrieval system. In Proc. of the Workshop on Design Issues in Anonymity and Unobservability (Berkeley, CA, July 2000), pp. 311–320.Google Scholar
  5. [5]
    DABEK, F., KAASHOEK, M. F., KARGER, D., MORRIS, R., AND STOICA, I. Wide-area cooperative storage with CFS. In Proc. of ACM SOSP (October 2001).Google Scholar
  6. [6]
    DINGLEDINE, R., FREEDMAN, M., AND MOLNAR, D. The freehaven project: Distributed anonymous storage service. In Proc. of the Workshop on Design Issues in Anonymity and Unobservability (July 2000).Google Scholar
  7. [7]
    DRUSCHEL, P., AND ROWSTRON, A. Storage management and caching in PAST, a largescale, persistent peer-to-peer storage utility. In Proc. of ACM SOSP (2001).Google Scholar
  8. [8]
    KUBIATOWICZ, J., ET AL. Oceanstore: An architecture for global-scale persistent storage. In Proc. of ASPLOS (Nov. 2000), ACM.Google Scholar
  9. [9]
    PATTERSON, D., GIBSON, G., AND KATZ, R. The case for raid: Redundant arrays of inexpensive disks, May 1988.Google Scholar
  10. [10]
    PATTERSON, D., AND HENNESSY, J. Computer Architecture: A Quantitative Approach. Forthcoming Edition.Google Scholar
  11. [11]
    RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SCHENKER, S. A scalable content-addressable network. In Proceedings of SIGCOMM (August 2001), ACM.Google Scholar
  12. [12]
    RHEA, S., WELLS, C., EATON, P., GEELS, D., ZHAO, B., WEATHERSPOON, H., AND KUBIATOWICZ, J. Maintenance free global storage in oceanstore. In Proc. of IEEE Internet Computing (2001), IEEE.Google Scholar
  13. [13]
    STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM (August 2001), ACM.Google Scholar
  14. [14]
    ZHAO, B., JOSEPH, A., AND KUBIATOWICZ, J. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB//CSD-01-1141, University of California, Berkeley Computer Science Division, April 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hakim Weatherspoon
    • 1
  • John D. Kubiatowicz
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley

Personalised recommendations