Graftage Coding for Distributed Storage Systems
Graftage Coding for Distributed Storage Systems
复制标题
DOI：
10.1109/tit.2021.3056487
复制
发表时间：
2021-04-01
影响因子：
2.5
通讯作者：
Wang, Zulin
中科院分区：
文献类型：
--
作者：
Rui, Jiayi;Huang, Qin;Wang, Zulin
为了实现存储和修复带宽之间的各种折衷，本文提出通过嫁接两个码C-1和C-2来构造精确修复码。通过用零替换C-1的生成矩阵中的某些非零项，所得到的嫁接部分的修复带宽减小。然而，它可能不再保持最大距离可分离（MDS）属性。因此，移植代码C-2考虑这些非零条目，使得整个移植代码可以保持MDS属性。推导了C-1的带宽减少与C-2的文件大小之间的关系，以优化嫁接代码。我们的分析表明，这些嫁接代码可以提供更好的权衡比空间共享。
To achieve various tradeoffs between storage and repair bandwidth, this article proposes to construct exact repair codes by grafting two codes C-1 and C-2. By replacing certain nonzero entries in the generator matrix of C-1 by zero, the repair bandwidth of the resulting grafting part decreases. However, it may no longer keep the maximum-distance-separable (MDS) property. As a result, the grafted code C-2 takes these nonzero entries into account such that the entire graftage code can keep the MDS property. The relationship between the bandwidth reduction of C-1 and the file size of C-2 is derived to optimize graftage codes. Our analysis indicates that these graftage codes may provide better tradeoffs than space-sharing.