通过复制方式降低修复带宽的新再生码
发布时间：2018-08-20 14:08
【摘要】：再生码通过允许节点传送所存数据的线性组合并增加修复入度,显著地降低了修复带宽,但是增加了参与节点数和磁盘I/O。针对这一缺点,首先通过分析再生码的阈值函数得到一个定理,指出了降低阈值函数的一个充要条件;然后根据该定理构造出了结合复制方式的新再生码。新再生码不增加修复入度也能降低阈值函数,与再生码类似,也有两个特殊点——最小存储量点和最小修复带宽点。通过对两个特殊点的定性与定量分析,发现新再生码可以利用复制来降低单节点修复带宽,并且平均修复带宽和平均磁盘I/O也会减少。
[Abstract]:The regenerative code significantly reduces the repair bandwidth by allowing nodes to transmit linear combinations of stored data and increases repair input but increases the number of participating nodes and disk I / O. In view of this shortcoming, a theorem is obtained by analyzing the threshold function of the reproducing code, and a necessary and sufficient condition for reducing the threshold function is pointed out, and then a new reproducing code combined with the reproduction mode is constructed according to the theorem. The new regenerative code can reduce the threshold function without increasing the repair penetration. Similar to the reproducing code, there are two special points: the minimum memory point and the minimum repair bandwidth point. Through the qualitative and quantitative analysis of two special points, it is found that the new regenerated code can reduce the repair bandwidth of single node by using replication, and the average repair bandwidth and the average disk I / O can also be reduced.
【作者单位】： 空军工程大学防空反导学院;
【分类号】：TP333
，
本文编号：2193890
[Abstract]:The regenerative code significantly reduces the repair bandwidth by allowing nodes to transmit linear combinations of stored data and increases repair input but increases the number of participating nodes and disk I / O. In view of this shortcoming, a theorem is obtained by analyzing the threshold function of the reproducing code, and a necessary and sufficient condition for reducing the threshold function is pointed out, and then a new reproducing code combined with the reproduction mode is constructed according to the theorem. The new regenerative code can reduce the threshold function without increasing the repair penetration. Similar to the reproducing code, there are two special points: the minimum memory point and the minimum repair bandwidth point. Through the qualitative and quantitative analysis of two special points, it is found that the new regenerated code can reduce the repair bandwidth of single node by using replication, and the average repair bandwidth and the average disk I / O can also be reduced.
【作者单位】： 空军工程大学防空反导学院;
【分类号】：TP333
，
本文编号：2193890
本文链接：https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2193890.html
