| Paper ID | D5-S5-T4.1 |
| Paper Title |
An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization |
| Authors |
Zhengyi Jiang, Dalian University of Technology, China; Hanxu Hou, Huawei Tech. Co. Ltd., China; Yunghsiang S. Han, Dongguan University of Technology, China; Zhongyi Huang, Tsinghua University, China; Bo Bai, Gong Zhang, Huawei Tech. Co. Ltd., China |
| Session |
D5-S5-T4: Bandwidth and Latency for Distributed Storage |
| Chaired Session: |
Friday, 16 July, 23:20 - 23:40 |
| Engagement Session: |
Friday, 16 July, 23:40 - 00:00 |
| Abstract |
Piggybacking is a class of coding framework for MDS array codes that can achieve small repair bandwidth with small sub-packetization. An $(n,k,\alpha)$ piggybacking code can be represented by an $n \times \alpha$ array such that each node (row) stores $\alpha$ symbols and any $k$ rows can retrieve all $k\alpha$ data symbols. In this paper, we first propose a new piggybacking framework for MDS array codes with lower sub-packetization and then propose two specific piggybacking codes based on the proposed framework. We show that the average repair bandwidth of any single-node failure of our piggybacking codes is lower than all the existing piggybacking codes with the same parameters when the sub-packetization is small (usually $\alpha\leq 8$) and $n-k\geq 10$
|
