Decentralized erasure codes for distributed networked storage

Authors:
A. G. Dimakis;V. Prabhakaran;K. Ramchandran
Affiliations:
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

Designing and embedding reliable virtual infrastructures

ACM SIGCOMM Computer Communication Review
Data security in unattended wireless sensor networks with mobile sinks

Wireless Communications & Mobile Computing
Outage Probability of Regenerative Protocols for Two-Source Two-Destination Networks

Wireless Personal Communications: An International Journal
Trevi: watering down storage hotspots with cool fountain codes

Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Sporadic decentralized resource maintenance for P2P distributed storage networks

Journal of Parallel and Distributed Computing
Benefits of network coding for unicast application in disruption-tolerant networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	754.84

Visualization

Abstract

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