DocumentCode
639945
Title
Explicit MBR all-symbol locality codes
Author
Kamath, G.M. ; Silberstein, Natalia ; Prakash, N. ; Rawat, A.S. ; Lalitha, V. ; Koyluoglu, O.O. ; Kumar, P.V. ; Vishwanath, Sriram
Author_Institution
Dept. of ECE, Indian Inst. of Sci., Bangalore, India
fYear
2013
fDate
7-12 July 2013
Firstpage
504
Lastpage
508
Abstract
Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.
Keywords
codes; storage management; DSS; Gabidulin codes; distributed storage systems; explicit MBR all-symbol locality codes; minimum bandwidth regenerating local codes; regenerating codes; repair-by-transfer; Encoding; Generators; Maintenance engineering; Polynomials; Silicon; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620277
Filename
6620277
Link To Document