Erasure Coding vs. Replication: A Quantitative Comparison (2002) [96 citations — 9 self]
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. 1
Citations
| 2113 | Chord: A scalable peer-to-peer lookup service for internet applications – Stoica, Morris, et al. |
| 1749 | A scalable content-addressable network – Ratnasamy, Francis, et al. - 2001 |
| 652 | Freenet: A Distributed Anonymous Information Storage and Retrieval System – Clarke, Sandberg, et al. - 2000 |
| 643 | Oceanstore: An architecture for global-scale persistent storage – Kubiatowicz, Bindel, et al. - 2000 |
| 581 | Wide-area cooperative storage with CFS – Dabek, Kaashoek, et al. - 2001 |
| 452 | Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility – Rowstron, Druschel - 2001 |
| 201 | Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs – Bolosky, Douceur, et al. - 2000 |
| 144 | The Eternity Service – Anderson - 1996 |
| 91 | A prototype implementation of archival intermemory.In – Chen, Edler, et al. - 1999 |
| 15 | RAID: Redundant Arrays of Inexpensive Disks – Patterson - 1988 |

