Erasure Coding vs. Replication: A Quantitative Comparison Export

@misc{erasurecodes-comparison-Weatherspoon-Kubiatowicz, 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...}, author = {Weatherspoon, H. and Kubiatowicz, J.}, citeulike-article-id = {274016}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3761}, keywords = {codes, data, p2p}, posted-at = {2005-08-04 19:38:23}, priority = {3}, title = {Erasure Coding vs. Replication: A Quantitative Comparison}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3761} }

TY - GEN ID - erasurecodes-comparison-Weatherspoon-Kubiatowicz L3 - citeulike-article-id:274016 N2 - 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... TI - Erasure Coding vs. Replication: A Quantitative Comparison KW - codes KW - data KW - p2p AU - Weatherspoon, H AU - Kubiatowicz, J UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3761 ER -