Title :
Update efficient codes for distributed storage
Author :
Rawat, Ankit Singh ; Vishwanath, Sriram ; Bhowmick, Abhishek ; Soljanin, Emina
Author_Institution :
Dept. of ECE, Univ. of Texas at Austin, Austin, TX, USA
fDate :
July 31 2011-Aug. 5 2011
Abstract :
This paper determines mechanisms for distributed storage that are simultaneously repair and update efficient. Repair efficiency demands that minimum information be downloaded from surviving nodes to reconstruct failed storage nodes. Update efficiency desires that changes in the original data require minimal updates at the storage nodes. These two requirements can be seen as counteracting one another, as the latter imposes a sparsity constraint on the encoding process that is not desirable for the former. In this paper we establish the existence of the codes that meet both requirements: require only logarithmic updates when data changes, while simultaneously minimizing repair bandwidth for exact reconstruction. To show this, we use a combination of KG codes for update efficiency with interference-alignment strategies for distributed storage.
Keywords :
codes; interference suppression; KG code; Kolchin-Generator code; distributed storage; encoding process; failed storage node reconstruction; interference-alignment strategy; logarithmic updates; repair bandwidth minimization; sparsity constraint; surviving node; update efficient code; Bandwidth; Complexity theory; Decision support systems; Encoding; Maintenance engineering; Polynomials; Systematics;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6033782