Affordable Access

Explicit MBR All-Symbol Locality Codes

Authors
  • Kamath, Govinda M.
  • Silberstein, Natalia
  • Prakash, N.
  • Rawat, Ankit S.
  • Lalitha, V.
  • Koyluoglu, O. Ozan
  • Kumar, P. Vijay
  • Vishwanath, Sriram
Type
Preprint
Publication Date
May 27, 2013
Submission Date
Feb 04, 2013
Identifiers
arXiv ID: 1302.0744
Source
arXiv
License
Yellow
External links

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.

Report this publication

Statistics

Seen <100 times