【摘要】：再生碼通過允許節(jié)點(diǎn)傳送所存數(shù)據(jù)的線性組合并增加修復(fù)入度,顯著地降低了修復(fù)帶寬,但是增加了參與節(jié)點(diǎn)數(shù)和磁盤I/O。針對(duì)這一缺點(diǎn),首先通過分析再生碼的閾值函數(shù)得到一個(gè)定理,指出了降低閾值函數(shù)的一個(gè)充要條件;然后根據(jù)該定理構(gòu)造出了結(jié)合復(fù)制方式的新再生碼。新再生碼不增加修復(fù)入度也能降低閾值函數(shù),與再生碼類似,也有兩個(gè)特殊點(diǎn)——最小存儲(chǔ)量點(diǎn)和最小修復(fù)帶寬點(diǎn)。通過對(duì)兩個(gè)特殊點(diǎn)的定性與定量分析,發(fā)現(xiàn)新再生碼可以利用復(fù)制來降低單節(jié)點(diǎn)修復(fù)帶寬,并且平均修復(fù)帶寬和平均磁盤I/O也會(huì)減少。
[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.
【作者單位】： 空軍工程大學(xué)防空反導(dǎo)學(xué)院;
【分類號(hào)】：TP333
，

本文編號(hào)：2193890