论文标题
一个有效的背包设计框架，带子包装$ l \ le R $用于全节点维修
An Efficient Piggybacking Design Framework with Sub-packetization $l\le r$ for All-Node Repair
论文作者
论文摘要
背式设计已被广泛应用于分布式存储系统中，因为它可以用小的子包装大大降低维修带宽。与其他现有的擦除代码相比，背式背包更方便操作，I/O成本较低。在本文中，我们提出了一种新的高效设计，可以通过子包装$ l \ le r $进一步降低维修带宽，其中$ r = n-k $。通常，我们让$ l \ le 8 $。与其他类似设计相比，我们的设计具有较低的$ l $，$ L $的值更加灵活。此外，我们的设计可以用小维修带宽来维修所有节点。因此，我们的背包设计更可行。
Piggybacking design has been widely applied in distributed storage systems since it can greatly reduce the repair bandwidth with small sub-packetization. Compared with other existing erasure codes, piggybacking is more convenient to operate and the I/O cost is lower. In this paper, we propose a new efficient design which can further reduce the repair bandwidth with the sub-packetization $l\le r$ where $r = n-k$. Generally, we let $l\le 8$. Compared with other analogous designs, our design has lower $l$ and the value of $l$ is more flexible. Moreover, our design can repair all nodes with small repair bandwidth. Therefore our piggybacking design is more feasible.
