Decentralized erasure codes for distributed networked storage

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

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2006-06, Vol.52 (6), p.2809-2816
Hauptverfasser:	Dimakis, A.G., Prabhakaran, V., Ramchandran, K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Codes Coding Coding, codes Collectors Communication system security Conferences Cost engineering Cryptography Data sources Decentralized Decentralized erasure codes distributed storage Exact sciences and technology Graphs IEEE magazines Information rates Information retrieval Information theory Information, signal and communications theory Linear programming Network coding Network topology Networks Optimization Random variables Signal and communications theory Storage area networks Studies Telecommunications and information theory Upper bound wireless networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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
ISSN:	0018-9448 1063-6692 1557-9654 1558-2566
DOI:	10.1109/TIT.2006.874535