Regenerating Codes for Distributed Storage Networks

Shah, Nihar B and Rashmi, KV and Kumar, Vijay P and Ramchandran, Kannan (2010) Regenerating Codes for Distributed Storage Networks. In: 3rd International Workshop on Arithmetic of Finite Fields, JUN 27-30, 2010, Istanbul, pp. 215-223.

PDF waifi_page1.pdf Restricted to Registered users only Download (3MB) | Request a copy

Abstract

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.

Item Type:	Conference Paper
Series.:	Lecture Notes in Computer Science
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Keywords:	Distributed storage; MDS codes; Regenerating codes; Repair bandwidth; Interference alignment
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	11 Oct 2010 04:53
Last Modified:	18 Oct 2010 05:33
URI:	http://eprints.iisc.ac.in/id/eprint/33153

Actions (login required)

View Item