On the I/O Costs in Repairing Short-Length Reed-Solomon Codes

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.

[1]  Alexander Vardy,et al.  Improved schemes for asymptotically optimal repair of MDS codes , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Alexander Barg,et al.  Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[3]  Hamid Jafarkhani,et al.  A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Mary Wootters,et al.  Repairing multiple failures for scalar MDS codes , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  Hoang Dau,et al.  Low bandwidth repair of the RS(10,4) Reed-Solomon code , 2017, 2017 Information Theory and Applications Workshop (ITA).

[6]  Itzhak Tamo,et al.  Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[7]  Han Mao Kiah,et al.  Repairing Reed-Solomon Codes With Multiple Erasures , 2016, IEEE Transactions on Information Theory.

[8]  Dimitris S. Papailiopoulos,et al.  A repair framework for scalar MDS codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Hoang Dau,et al.  Optimal repair schemes for some families of full-length reed-solomon codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[10]  Ron M. Roth,et al.  Introduction to Coding Theory , 2019, Discrete Mathematics.

[11]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[12]  Emanuele Viterbo,et al.  Repair Schemes with Optimal I/O Costs for Full-Length Reed-Solomon Codes with Two Parities , 2018, 2018 IEEE Information Theory Workshop (ITW).

[13]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[14]  Hoang Dau,et al.  On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  Han Mao Kiah,et al.  Repairing reed-solomon codes with two erasures , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[16]  Itzhak Tamo,et al.  The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size , 2019, IEEE Transactions on Information Theory.