Regenerating codes for errors and erasures in distributed storage

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Conference object 01 Jul 2012Embargo end date: 01 Feb 2012Publisher:IEEEJournal:2012 IEEE International Symposium on Information Theory Proceedings

Authors: K. V. Rashmi; Nihar B. Shah; Kannan Ramchandran; P. Vijay Kumar;

doi: 10.1109/isit.2012.6283046 , 10.48550/arxiv.1202.1050

arXiv: 1202.1050

Regenerating codes for errors and erasures in distributed storage

- Summary
- Subjects
- Metrics

Abstract

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

ISIT 2012

Related Organizations

Indian Institute of Science Bangalore
India
University of California, Berkeley
United States
University of California System
United States

Keywords

Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Information Theory, Information Theory (cs.IT), Distributed, Parallel, and Cluster Computing (cs.DC)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	74
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%