具有较低修复带宽开销的局部Piggybacking码构造

Construction of locally piggybacking codes with lower repair bandwidth overhead

  • 摘要: 目前针对Piggybacking码的研究主要聚焦在单个信息节点的快速修复上,校验节点故障的修复带宽率依旧较高,且对多节点故障修复尚未提出快速修复算法。为此,该文提出一种局部Piggybacking码的构造方案,在Piggybacking框架的基础上,增加2个局部校验子条带,并将数据块错位放置,信息节点分组按顺序捎带,以此降低故障节点的修复带宽开销和修复度。性能分析表明,该文所构造的局部Piggybacking码,其信息节点和校验节点的修复带宽率都有显著降低,且与现有的Piggybacking码相比,修复度性能也有明显改善。

     

    Abstract: The current research on Piggybacking codes mainly focuses on the fast repair of single systematic nodes, the repair bandwidth rates of the failed parity nodes remain higher, and fast repair algorithm has not been proposed for multi-node fault repair. For this reason, this paper proposes the construction scheme of locally Piggybacking codes. Specifically, on the basis of Piggybacking framework, two local parity sub-strips are added, the data blocks placed in a staggered manner, the systematic node grouped in sequential piggybacking, to reduce the repair bandwidth overhead and repair degree of the failed nodes. Performance analyses show that, the locally Piggybacking codes constructed in this paper have reduced the repair bandwidth rate of both the systematic nodes and parity nodes prominently, and compared to the existing Piggybacking codes, the performance of the repair degree also has a significant improvement.

     

/

返回文章
返回