Erasure Coding Vs. Replication: A Quantitative Comparison
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
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.
- ANDERSON, R. The eternity service. In Proceedings of Pragocrypt (1996).
- 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).
- 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.
- 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.
- 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).
- 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).
- 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).
- KUBIATOWICZ, J., ET AL. Oceanstore: An architecture for global-scale persistent storage. In Proc. of ASPLOS (Nov. 2000), ACM.
- PATTERSON, D., GIBSON, G., AND KATZ, R. The case for raid: Redundant arrays of inexpensive disks, May 1988.
- PATTERSON, D., AND HENNESSY, J. Computer Architecture: A Quantitative Approach. Forthcoming Edition.
- RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SCHENKER, S. A scalable content-addressable network. In Proceedings of SIGCOMM (August 2001), ACM.
- 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.
- 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.
- 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.
- Erasure Coding Vs. Replication: A Quantitative Comparison
- Book Title
- Peer-to-Peer Systems
- Book Subtitle
- First InternationalWorkshop, IPTPS 2002 Cambridge, MA, USA, March 7–8, 2002 Revised Papers
- pp 328-337
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 4. Rice University
- 5. MIT Laboratory of Computer Science
- 6. Microsoft Research Ltd.
- Author Affiliations
- 7. Computer Science Division, University of California, Berkeley
To view the rest of this content please follow the download PDF link above.