Decentralized Erasure Codes for Distributed Networked Storage

zbMATH Open1293.94136arXivcs/0606049MaRDI QIDQ3546799FDOQ3546799

Authors: Alexandros G. Dimakis, Vinod M. Prabhakaran, Kannan Ramchandran 

Publication date: 21 December 2008

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.

Full work available at URL: https://arxiv.org/abs/cs/0606049

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Other types of codes (94B60)

Cited In (2)

• The one-out-of-\(k\) retrieval problem and linear network coding
• Correcting adversarial errors with generalized regenerating codes

This page was built for publication: Decentralized Erasure Codes for Distributed Networked Storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546799)