Regenerating codes for errors and erasures in distributed storage

Rashmi, KV and Shah, Nihar B and Ramchandran, Kannan and Kumar, Vijay P (2012) Regenerating codes for errors and erasures in distributed storage. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), 1-6 July 2012, Cambridge, MA.

PDF Info_The_Proc_1202_2012.pdf - Published Version Restricted to Registered users only Download (332kB) | Request a copy

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 at the nodes or links, 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.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright of this article belongs to IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	17 Dec 2013 07:13
Last Modified:	17 Dec 2013 07:13
URI:	http://eprints.iisc.ac.in/id/eprint/48015

Actions (login required)

View Item