Results 1 - 10 of 1,629

Effective Erasure Codes for Reliable Computer Communication Protocols

by Luigi Rizzo , 1997
"... Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend to b ..."
Abstract - Cited by 470 (14 self) - Add to MetaCart
to become uncorrelated thus greatly reducing the effectiveness of retransmissions. In such cases, Forward Error Correction (FEC) techniques can be used, consisting in the transmission of redundant packets (based on error correcting codes) to allow the receivers to recover from independent packet losses

Erasure Code Replication Revisited

by W. K. Lin, D. M. Chiu, Y. B. Lee - In PTP04: 4th International Conference on Peer-to-Peer Computing. IEEE , 2004
"... Erasure coding is a technique for achieving high availability and reliability in storage and communication systems. In this paper, we revisit the analysis of erasure code replication and point out some situations when whole-file replication is preferred. The switchover point (from preferring whole-f ..."
Abstract - Cited by 46 (0 self) - Add to MetaCart
Erasure coding is a technique for achieving high availability and reliability in storage and communication systems. In this paper, we revisit the analysis of erasure code replication and point out some situations when whole-file replication is preferred. The switchover point (from preferring whole

1 Repairing Erasure Codes

by Dimitris S. Papailiopoulos, Ros G. Dimakis
"... Abstract—Distributed storage systems introduce redundancy to increase reliability. When erasure coding is used, the exact repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. This a ..."
Abstract - Add to MetaCart
Abstract—Distributed storage systems introduce redundancy to increase reliability. When erasure coding is used, the exact repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node

General Terms Erasure codes

by Erik M. Ferragut
"... Digital fountains, a class of erasure codes, have been used for multicasting stream data and for robust distributed data storage. These methods produce a potentially endless se-quence of packets from a fixed (static) message. The dy-namic erasure code problem is to extend the digital foun-tains conc ..."
Abstract - Add to MetaCart
Digital fountains, a class of erasure codes, have been used for multicasting stream data and for robust distributed data storage. These methods produce a potentially endless se-quence of packets from a fixed (static) message. The dy-namic erasure code problem is to extend the digital foun

Erasure Coding vs. Replication: A Quantitative Comparison

by Hakim Weatherspoon, John D. Kubiatowicz - In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS 2002 , 2002
"... Abstract. Peer-to-peer systems are positioned to take advantage of gains in network bandwidth, storage capacity, and computational resources to provide longterm durable storage infrastructures. In this paper, we quantitatively compare building a distributed storage infrastructure that is self-repair ..."
Abstract - Cited by 282 (11 self) - Add to MetaCart
-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

of the Jerasure Erasure Coding Library

by Parth Deshmukh, Sean Maginnis, Josh Chandler, Parth Deshmukh
"... The University of Tennessee- thank you for your patience! 2 Project Description The Jerasure library, originally released in 2007, has proven an in-valuable tool in the study of erasure coding. Over the three years since its release, however, the original authors and we have realized the need to ove ..."
Abstract - Add to MetaCart
The University of Tennessee- thank you for your patience! 2 Project Description The Jerasure library, originally released in 2007, has proven an in-valuable tool in the study of erasure coding. Over the three years since its release, however, the original authors and we have realized the need

Erasure Coding in Windows Azure Storage

by Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, Sergey Yekhanin
"... Windows Azure Storage (WAS) is a cloud storage system that provides customers the ability to store seemingly limitless amounts of data for any duration of time. WAS customers have access to their data from anywhere, at any time, and only pay for what they use and store. To provide durability for tha ..."
Abstract - Cited by 54 (1 self) - Add to MetaCart
for that data and to keep the cost of storage low, WAS uses erasure coding. In this paper we introduce a new set of codes for erasure coding called Local Reconstruction Codes (LRC). LRC reduces the number of erasure coding fragments that need to be read when reconstructing data fragments that are offline, while

Verifying distributed erasure-coded data

by James Hendricks - In Proceedings of the 26 th ACM Symposium on Principles of Distributed Computing , 2007
"... Erasure coding can reduce the space and bandwidth overheads of redundancy in fault-tolerant data storage and delivery systems. But it introduces the fundamental difficulty of ensuring that all erasurecoded fragments correspond to the same block of data. Without such assurance, a different block may ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
Erasure coding can reduce the space and bandwidth overheads of redundancy in fault-tolerant data storage and delivery systems. But it introduces the fundamental difficulty of ensuring that all erasurecoded fragments correspond to the same block of data. Without such assurance, a different block may

Efficient Erasure Codes

by Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman, Volker Stemann - IEEE Trans. on Inform. Theory , 2001
"... We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graph and analyze the algorithm using the theory of discrete time random processes. As a result we obtain a simple criterion invovlving the fractions of nodes of different degrees on both sides of th ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graph and analyze the algorithm using the theory of discrete time random processes. As a result we obtain a simple criterion invovlving the fractions of nodes of different degrees on both sides

Erasure-coding based routing for opportunistic networks

by Yong Wang, Sushant Jain, Margaret Martonosi, Kevin Fall , 2005
"... mobility is a challenging problem because disconnections are prevalent and lack of knowledge about network dynamics hinders good decision making. Current approaches are primarily based on redundant transmissions. They have either high overhead due to excessive transmissions or long delays due to the ..."
Abstract - Cited by 126 (4 self) - Add to MetaCart
to the possibility of making wrong choices when forwarding a few redundant copies. In this paper, we propose a novel forwarding algorithm based on the idea of erasure codes. Erasure coding allows use of a large number of relays while maintaining a constant overhead, which results in fewer cases of long delays. We
Results 1 - 10 of 1,629