On the I/O costs in repairing short-length reed-Solomon codes

Weiqi Li, Hoang Dau, Zhiying Wang, Hamid Jafarkhani, Emanuele Viterbo

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

13 Citations (Scopus)

Abstract

Minimizing the repair bandwidth, i.e., the amount of information from the helper nodes needed for recovering the content of one failed node in an erasure-coded distributed storage system, has been the focus of many works in the literature. We investigate another important performance metric, namely the I/O cost, which specifies the amount of information that needs to be read by the helper nodes during the repair process of one failed node. We analyze the I/O costs of a few known repair schemes for Reed-Solomon codes of various lengths, in contrast to the previous works in this direction, which only studied the I/O costs in repairing full-length Reed-Solomon codes.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Information Theory
Subtitle of host publicationProceedings
EditorsGiuseppe Caire, Venugopal V. Veeravalli, Aaron B. Wagner, Gilles Zemor
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages1087-1091
Number of pages5
ISBN (Electronic)9781538692912, 9781538692905
ISBN (Print)9781538692929
DOIs
Publication statusPublished - 1 Jul 2019
EventIEEE International Symposium on Information Theory 2019 - Paris, France
Duration: 7 Jul 201912 Jul 2019
https://2019.ieee-isit.org/
https://ieeexplore.ieee.org/xpl/conhome/8827389/proceeding (Proceedings)

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE, Institute of Electrical and Electronics Engineers
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory 2019
Abbreviated titleISIT 2019
Country/TerritoryFrance
CityParis
Period7/07/1912/07/19
Internet address

Cite this