Irregular flat XOR codes for reducing repair bandwidth of multi-point distributed storage systems
Yui Yoshida, Takayuki Nakachi, Daisuke Shirai, Tatsuya Fujii · 2016
To ensure the reliability of distributed storage systems, we studied network bandwidth-aware multiple fault tolerant erasure codes. A flat XOR code is one of the sparse graph codes designed for distributed storage systems. It encodes and decodes data by exclusive OR (XOR) operation with low complexity. However, conventional construction methods of flat XOR codes are not optimal in terms of repair bandwidth. In this paper, we propose two novel constructions of irregular flat XOR code that can remarkably reduce repair bandwidth compared to conventional flat XOR codes and Reed-Solomon codes. Our irregular flat XOR codes also reduce repair bandwidth compared to flat XOR codes designed by the Monte-Carlo method.