International Workshop on Peer-to-Peer Systems

IPTPS 2002: Peer-to-Peer Systems pp 328-337

Erasure Coding Vs. Replication: A Quantitative Comparison

  • Hakim Weatherspoon
  • John D. Kubiatowicz
Conference paper

DOI: 10.1007/3-540-45748-8_31

Volume 2429 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Weatherspoon H., Kubiatowicz J.D. (2002) Erasure Coding Vs. Replication: A Quantitative Comparison. In: Druschel P., Kaashoek F., Rowstron A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

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