Low bandwidth repair of the RS(10,4) Reed-Solomon code

Iwan Duursma; Hoang Da

doi:10.1109/ITA.2017.8023449

Low bandwidth repair of the RS(10,4) Reed-Solomon code

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.

Original language	English (US)
Title of host publication	2017 Information Theory and Applications Workshop, ITA 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781509052936
DOIs	https://doi.org/10.1109/ITA.2017.8023449
State	Published - Aug 30 2017
Event	2017 Information Theory and Applications Workshop, ITA 2017 - San Diego, United States Duration: Feb 12 2017 → Feb 17 2017

Publication series

Name	2017 Information Theory and Applications Workshop, ITA 2017

Other

Other	2017 Information Theory and Applications Workshop, ITA 2017
Country/Territory	United States
City	San Diego
Period	2/12/17 → 2/17/17

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Software
Computational Theory and Mathematics

Online availability

10.1109/ITA.2017.8023449

Library availability

Discover UIUC Full Text

Cite this

Duursma, I & Da, H 2017, Low bandwidth repair of the RS(10,4) Reed-Solomon code. in 2017 Information Theory and Applications Workshop, ITA 2017., 8023449, 2017 Information Theory and Applications Workshop, ITA 2017, Institute of Electrical and Electronics Engineers Inc., 2017 Information Theory and Applications Workshop, ITA 2017, San Diego, United States, 2/12/17. https://doi.org/10.1109/ITA.2017.8023449

@inproceedings{499cc1360dd44406a65dd65e181d9cd2,

title = "Low bandwidth repair of the RS(10,4) Reed-Solomon code",

abstract = "As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.",

author = "Iwan Duursma and Hoang Da",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 Information Theory and Applications Workshop, ITA 2017 ; Conference date: 12-02-2017 Through 17-02-2017",

year = "2017",

month = aug,

day = "30",

doi = "10.1109/ITA.2017.8023449",

language = "English (US)",

series = "2017 Information Theory and Applications Workshop, ITA 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2017 Information Theory and Applications Workshop, ITA 2017",

address = "United States",

}

TY - GEN

T1 - Low bandwidth repair of the RS(10,4) Reed-Solomon code

AU - Duursma, Iwan

AU - Da, Hoang

PY - 2017/8/30

Y1 - 2017/8/30

N2 - As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.

AB - As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.

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

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

U2 - 10.1109/ITA.2017.8023449

DO - 10.1109/ITA.2017.8023449

M3 - Conference contribution

AN - SCOPUS:85030985004

T3 - 2017 Information Theory and Applications Workshop, ITA 2017

BT - 2017 Information Theory and Applications Workshop, ITA 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 Information Theory and Applications Workshop, ITA 2017

Y2 - 12 February 2017 through 17 February 2017

ER -

Low bandwidth repair of the RS(10,4) Reed-Solomon code

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this