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

Iwan M Duursma, Hoang Da

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publication2017 Information Theory and Applications Workshop, ITA 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509052936
DOIs
StatePublished - Aug 30 2017
Event2017 Information Theory and Applications Workshop, ITA 2017 - San Diego, United States
Duration: Feb 12 2017Feb 17 2017

Other

Other2017 Information Theory and Applications Workshop, ITA 2017
CountryUnited States
CitySan Diego
Period2/12/172/17/17

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Software
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Low bandwidth repair of the RS(10,4) Reed-Solomon code'. Together they form a unique fingerprint.

  • Cite this

    Duursma, I. M., & Da, H. (2017). Low bandwidth repair of the RS(10,4) Reed-Solomon code. In 2017 Information Theory and Applications Workshop, ITA 2017 [8023449] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITA.2017.8023449