基于(k+2,k)MSR的多容错低修复带宽编码

Multiple Fault Tolerant and LowRepairing Bandwidth Coding Based on(k+2,k) MSR

传统(k+2,k)最小存储再生码(MSR)在双节点失效的情况下,会有较高的修复带宽。为此,提出一种多容错编码方案。通过引入4个备份校验节点,使编码的上下部分均形成最小存储再生码结构。仿真结果表明,与现有的(k+2,k)MSR方案相比,该方案能降低双节点失效时的修复带宽。

Traditional （k＋2,k） Minimum Storage Regeneration Codes（MSR） have a high repair bandwidth in the event of two system nodes fail.A safe,efficient,multi-fault tolerant coding scheme is proposed for this reason.The upper and lower parts of code are both formed MSR codes structure through the introduction of four backup check nodes.Simulation results show that compared with the existing （k＋2, k） MSR code scheme,this scheme can greatly reduce the repair bandwidth when two node fails.