Triple-Fault-Tolerant Binary MDS Array Codes with Asymptotically Optimal Repair
Refereed conference paper presented and published in conference proceedings

Altmetrics Information
.

Other information
AbstractBinary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy, but also achieve low computational complexity. They are constructed by encoding k information columns into r parity columns, in which each element in a column is a bit, such that any k out of the k + r columns suffice to recover all information bits. In addition to providing fault tolerance, it is critical to improve repair performance. Specifically, if a single column fails, our goal is to minimize the repair bandwidth by downloading the least amount of bits from d non-failed columns, where k ≤ d ≤ k + r − 1. However, existing binary MDS codes that achieve high data rates (i.e., k/(k + r) > 1/2) and minimum repair bandwidth only support double fault tolerance (i.e., r = 2), which is insufficient for failure-prone distributed storage environments in practice. This paper fills the void by proposing an explicit construction of triple-fault-tolerant (i.e., r = 3) binary MDS array codes that achieve asymptotically minimum repair bandwidth for d = k + 1.
All Author(s) ListHanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han, Yuchong Hu
Name of ConferenceProceedings of IEEE International Symposium on Information Theory (ISIT 2017)
Start Date of Conference25/06/2017
End Date of Conference30/06/2017
Place of ConferenceAachen
Country/Region of ConferenceGermany
Proceedings Title2017 IEEE International Symposium on Information Theory (ISIT)
Year2017
Month6
Pages839 - 843
ISBN978-1-5090-4097-1
eISBN978-1-5090-4096-4
eISSN2157-8117
LanguagesEnglish-United States

Last updated on 2020-03-08 at 04:30