發(fā)布時(shí)間：2018-04-20 06:04

  本文選題：再生碼 + 副本　； 參考：《計(jì)算機(jī)科學(xué)》2016年09期

【摘要】：(n,k,d)再生碼允許存儲(chǔ)節(jié)點(diǎn)傳送所存數(shù)據(jù)的線性組合以及增加修復(fù)入度d,顯著地降低了修復(fù)帶寬,但是引入了更多的參與節(jié)點(diǎn)數(shù)及磁盤I/O。針對(duì)這一不足,提出了一種將復(fù)制方式與再生碼結(jié)合的(n,k,d,λ,θ)部分再生碼,并得到了與再生碼類似的閾值函數(shù)和2個(gè)特殊點(diǎn)——最小存儲(chǔ)量點(diǎn)和最小修復(fù)帶寬點(diǎn)。部分再生碼可以綜合利用修復(fù)入度d和副本因子θ同時(shí)降低修復(fù)帶寬和磁盤I/O。當(dāng)所有的節(jié)點(diǎn)存儲(chǔ)量相等時(shí),部分再生碼的單點(diǎn)修復(fù)帶寬和磁盤I/O均優(yōu)于再生碼。定量比較的結(jié)果也顯示,在最小存儲(chǔ)量點(diǎn),部分再生碼比再生碼有更低的平均修復(fù)帶寬和平均磁盤I/O;在最小修復(fù)帶寬點(diǎn),部分再生碼有更低的平均磁盤I/O以及與再生碼相近的平均修復(fù)帶寬。更重要的是,部分再生碼適用于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 鈮，

本文編號(hào)：1776537