Decentralized Erasure Codes for Distributed Networked Storage
arXiv:cs/0606049 · doi:10.1109/TIT.2006.874535
Abstract
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k<n sources generating the data. We want a data collector, who can appear anywhere in the network, to query any k storage nodes and be able to retrieve the data. We introduce Decentralized Erasure Codes, which are linear codes with a specific randomized structure inspired by network coding on random bipartite graphs. We show that decentralized erasure codes are optimally sparse, and lead to reduced communication, storage and computation cost over random linear coding.
to appear in IEEE Transactions on Information Theory, Special Issue: Networking and Information Theory
Cited by in corpus (20)
- Fountain Codes Based Distributed Storage Algorithms for Large-scale Wireless Sensor Networks
- Doped Fountain Coding for Minimum Delay Data Collection in Circular Networks
- Optimal Storage Allocation for Wireless Cloud Caching Systems with a Limited Sum Storage Capacity
- BFT-DSN: A Byzantine Fault Tolerant Decentralized Storage Network
- Buffer-Based Distributed LT Codes
- Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments
- LT Codes For Efficient and Reliable Distributed Storage Systems Revisited
- Efficient distribution and improved security for reliable cloud storage system
- RapidRAID: Pipelined Erasure Codes for Fast Data Archival in Distributed Storage Systems
- Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network
- From Dumb Wireless Sensors to Smart Networks using Network Coding
- Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks
- A Distributed Data Collection Algorithm for Wireless Sensor Networks with Persistent Storage Nodes
- Energy Efficient Distributed Coding for Data Collection in a Noisy Sparse Network
- Repairable Fountain Codes
- Progressive Decoding for Data Availability and Reliability in Distributed Networked Storage
- Capacity of Wireless Distributed Storage Systems with Broadcast Repair
- Multiresolution Cube Estimators for Sensor Network Aggregate Queries
- PhantomOS: A Next Generation Grid Operating System
- Distributed Data Collection and Storage Algorithms for Collaborative Learning Vision Sensor Devices with Applications to Pilgrimage