Decentralized erasure codes for distributed networked storage
By A. Dimakis, Vinod M. Prabhakaran, Kannan Ramchandran. IEEE Transactions on Information Theory, 2006
298 citations recorded by the source corpus.
In this correspondence, 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.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/87a18136e065d47c267430e26b3c1c40864179e5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- A. Dimakis
- Kannan Ramchandran
- Brighten Godfrey
- Martin J. Wainwright
- Michael G. Rabbat
- Tommi S. Jaakkola
- Martin Jaggi
- Dimitris Papailiopoulos
Citations in the corpus
- Network Coding for Distributed Storage Systems (2007, methodology): “For distributed storage, the idea of using network coding wa s introduced in [6] for wireless sensor networks.”