与副本结合的部分再生码

发布时间：2018-04-20 06:04

  本文选题：再生码 + 副本　； 参考：《计算机科学》2016年09期

【摘要】：(n,k,d)再生码允许存储节点传送所存数据的线性组合以及增加修复入度d,显著地降低了修复带宽,但是引入了更多的参与节点数及磁盘I/O。针对这一不足,提出了一种将复制方式与再生码结合的(n,k,d,λ,θ)部分再生码,并得到了与再生码类似的阈值函数和2个特殊点——最小存储量点和最小修复带宽点。部分再生码可以综合利用修复入度d和副本因子θ同时降低修复带宽和磁盘I/O。当所有的节点存储量相等时,部分再生码的单点修复带宽和磁盘I/O均优于再生码。定量比较的结果也显示,在最小存储量点,部分再生码比再生码有更低的平均修复带宽和平均磁盘I/O;在最小修复带宽点,部分再生码有更低的平均磁盘I/O以及与再生码相近的平均修复带宽。更重要的是,部分再生码适用于d≤n-2的所有情形。
[Abstract]:The regenerative code allows storage nodes to transmit the linear combination of the stored data and increase the repair input, which significantly reduces the repair bandwidth, but introduces more participating nodes and disk I / O. In order to solve this problem, a partial reproducing code is proposed, which combines the replication mode with the regenerative code. The threshold function similar to the regenerative code and two special points, the minimum storage point and the minimum repair bandwidth point, are obtained. The partial regenerative code can reduce the repair bandwidth and disk I / O at the same time by synthetically utilizing the repair degree d and the replica factor 胃. When the storage capacity of all nodes is equal, the single-point repair bandwidth and disk I / O of partial regenerative code are better than that of regenerated code. The quantitative comparison also shows that at the minimum storage point, partial regenerative codes have lower average repair bandwidth and average disk I / O than regenerative codes; at the minimum repair bandwidth, Partial regenerative codes have lower average disk I / O and average repair bandwidth similar to those of regenerative codes. More importantly, partial reproduction codes are suitable for all cases where d 鈮，

本文编号：1776537