Erasure coding for distributed storage: an overview

Balaji, SB and Krishnan, Nikhil M and Vajha, Myna and Ramkumar, Vinayak and Sasidharan, Birenjith and Kumar, Vijay P (2018) Erasure coding for distributed storage: an overview. In: SCIENCE CHINA-INFORMATION SCIENCES, 61 (10).

PDF Sci_Chi-Inf_Sci_61-10_100301_2018.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes, namely regenerating codes and locally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomon code. This survey provides an overview of the efforts in this direction that have taken place over the past decade.

Item Type:	Editorials/Short Communications
Publication:	SCIENCE CHINA-INFORMATION SCIENCES
Publisher:	SCIENCE PRESS
Additional Information:	Copy right for this article belong to SCIENCE PRESS
Keywords:	distributed storage; regenerating codes; locally recoverable codes; codes with locality; erasure codes; node repair
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	03 Oct 2018 14:03
Last Modified:	25 Feb 2019 08:46
URI:	http://eprints.iisc.ac.in/id/eprint/60791

Actions (login required)

View Item