New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node Failure
Hao Shi, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Zhengyi Jiang, Zhongyi Huang, Bo Bai
Abstract
Piggybacking codes are an important class of array codes with small sub-packetization to achieve small repair bandwidth for single-node failures. In this paper, we propose new piggybacking codes such that the sub-packetization is equal to the number of parity nodes. Our piggybacking codes have an efficient repair method for any single-node failure, including both data nodes and parity nodes. We show that the proposed piggybacking codes have strictly less repair bandwidth for any single-node failure than that of the existing piggybacking codes, when the code rate is k/n = 0.8, 0.9 and the number of parity nodes ranges from 6 to 40.
Topics & Concepts
Computer scienceComputer networkAdvanced Data Storage TechnologiesInterconnection Networks and SystemsSemiconductor materials and devices