Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes

Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes d as d is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) α. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for d = n - 1, i.e., where all the remaining nodes serve as the helper nodes for the bandwidth-efficient repair of a single node. The results of this paper broaden the set of parameters where the constructions of MSR codes were known earlier.

Original languageEnglish (US)
Title of host publication2016 Information Theory and Applications Workshop, ITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509025299
DOIs
StatePublished - Mar 27 2017
Event2016 Information Theory and Applications Workshop, ITA 2016 - La Jolla, United States
Duration: Jan 31 2016Feb 5 2016

Other

Other2016 Information Theory and Applications Workshop, ITA 2016
CountryUnited States
CityLa Jolla
Period1/31/162/5/16

Fingerprint

Repair
Bandwidth
Polynomials

Keywords

  • Codes for distributed storage
  • minimum storage regenerating (MSR) codes
  • regenerating codes
  • sub-packetization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Artificial Intelligence
  • Information Systems
  • Signal Processing

Cite this

Rawat, A. S., Koyluoglu, O. O., & Vishwanath, S. (2017). Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes. In 2016 Information Theory and Applications Workshop, ITA 2016 [7888191] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITA.2016.7888191

Progress on high-rate MSR codes : Enabling arbitrary number of helper nodes. / Rawat, Ankit Singh; Koyluoglu, Onur Ozan; Vishwanath, Sriram.

2016 Information Theory and Applications Workshop, ITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. 7888191.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rawat, AS, Koyluoglu, OO & Vishwanath, S 2017, Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes. in 2016 Information Theory and Applications Workshop, ITA 2016., 7888191, Institute of Electrical and Electronics Engineers Inc., 2016 Information Theory and Applications Workshop, ITA 2016, La Jolla, United States, 1/31/16. https://doi.org/10.1109/ITA.2016.7888191
Rawat AS, Koyluoglu OO, Vishwanath S. Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes. In 2016 Information Theory and Applications Workshop, ITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. 7888191 https://doi.org/10.1109/ITA.2016.7888191
Rawat, Ankit Singh ; Koyluoglu, Onur Ozan ; Vishwanath, Sriram. / Progress on high-rate MSR codes : Enabling arbitrary number of helper nodes. 2016 Information Theory and Applications Workshop, ITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{5cfc0fe5e97d445088d48523695420da,
title = "Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes",
abstract = "This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes d as d is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) α. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for d = n - 1, i.e., where all the remaining nodes serve as the helper nodes for the bandwidth-efficient repair of a single node. The results of this paper broaden the set of parameters where the constructions of MSR codes were known earlier.",
keywords = "Codes for distributed storage, minimum storage regenerating (MSR) codes, regenerating codes, sub-packetization",
author = "Rawat, {Ankit Singh} and Koyluoglu, {Onur Ozan} and Sriram Vishwanath",
year = "2017",
month = "3",
day = "27",
doi = "10.1109/ITA.2016.7888191",
language = "English (US)",
booktitle = "2016 Information Theory and Applications Workshop, ITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Progress on high-rate MSR codes

T2 - Enabling arbitrary number of helper nodes

AU - Rawat, Ankit Singh

AU - Koyluoglu, Onur Ozan

AU - Vishwanath, Sriram

PY - 2017/3/27

Y1 - 2017/3/27

N2 - This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes d as d is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) α. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for d = n - 1, i.e., where all the remaining nodes serve as the helper nodes for the bandwidth-efficient repair of a single node. The results of this paper broaden the set of parameters where the constructions of MSR codes were known earlier.

AB - This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes d as d is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) α. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for d = n - 1, i.e., where all the remaining nodes serve as the helper nodes for the bandwidth-efficient repair of a single node. The results of this paper broaden the set of parameters where the constructions of MSR codes were known earlier.

KW - Codes for distributed storage

KW - minimum storage regenerating (MSR) codes

KW - regenerating codes

KW - sub-packetization

UR - http://www.scopus.com/inward/record.url?scp=85018290415&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85018290415&partnerID=8YFLogxK

U2 - 10.1109/ITA.2016.7888191

DO - 10.1109/ITA.2016.7888191

M3 - Conference contribution

AN - SCOPUS:85018290415

BT - 2016 Information Theory and Applications Workshop, ITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -