摘要
针对最初的减少校验节点修复带宽的Piggybacks捎带设计存在的问题,提出了一种均衡分配的Piggybacks捎带设计(Balanced-Allocation Piggybacks Adding,BAPA).首先,通过分析给出了新的Piggybacks捎带规则,在此基础上得出了能进一步减少校验节点修复带宽的Piggybacking设计BARSR-Ⅰ和BARSR-Ⅱ.然后,给出了BARSR-Ⅰ和BARSR-Ⅱ中校验节点的修复过程以及平均修复带宽率的推导值.最后,给出了BARSR-Ⅰ和BARSR-Ⅱ下的编码复杂度和修复复杂度.通过与现有的Piggybacking设计对比分析表明,BARSR-Ⅰ和BARSR-Ⅱ能有效的减少校验节点的修复带宽.
To address the problem of the original Piggybacks adding design which reduces the repair bandwidth of the parity nodes,we propose a balanced-allocation Piggybacks adding design(BAPA).Firstly,the new piggybacks adding rules are given through analysis,and on this base,the piggybacking design BARSR-Ⅰand BARSR-Ⅱwhich can further reduce the repair bandwidth of parity nodes,are given.Then,the repair process and theoretical derivation value of average repair bandwidth rate of parity nodes in BARSR-Ⅰand BARSR-Ⅱare given.Finally,the encoding complexity and repair complexity under BARSR-Ⅰand BARSR-Ⅱare given.The comparison analysis with the existing Piggybacking design shows that BARSR-Ⅰand BARSR-Ⅱcan effectively reduce the repair bandwidth of the parity nodes.
作者
周悦
李贵洋
韩鸿宇
李慧
胡金平
ZHOU Yue;LI Gui-yang;HAN Hong-yu;LI Hui;HU Jin-ping(Department of Computer Science,Sichuan Normal University,Chengdu,Sichuan 610101,China)
出处
《电子学报》
EI
CAS
CSCD
北大核心
2021年第4期812-816,共5页
Acta Electronica Sinica
基金
国家自然科学基金(No.61701331)。