一种基于纠删码的多节点失效修复算法  

Multi-node Failure Repair Algorithm Based on Erasure Code

作　　者：徐家冰 朱浩辰 杨丽[1] XU Jia-bing;ZHU Hao-chen;YANG Li(Yantai Research Institute, China Agricultural University, Yantai 264670, China)

机构地区：[1]中国农业大学烟台研究院,山东烟台264670

出　　处：《计算机与现代化》2021年第3期18-23,共6页Computer and Modernization

摘　　要：纠删码作为分布式系统中重要的数据容错技术,在失效数据的修复领域有着广泛应用。但现有的纠删码算法大多针对单节点修复,修复成本较高,且未考虑新生节点间的信息传递,给多失效节点的修复带来不便。基于此,提出一种基于纠删码的多节点失效修复算法,该算法在新生节点中利用节点选择策略选取中心节点为根节点,并依据链路带宽分别与供应节点和剩余新生节点构建最大修复树,从而降低数据修复时长。实验结果表明,与现有的BHS和SSR串行修复等方法相比,该算法能有效提高多失效节点的修复效率,验证了算法的有效性。As an important data fault-tolerance technology in a distributed system,the correction and deletion of code are widely used in the field of repair of invalid data.However,most of the existing correction and deletion algorithm aim at single-node repair,which has a high repair cost and does not consider the information transmission between the new nodes,bringing inconvenience to the repair of multiple-fail nodes.Based on this,a multi-node failure repair algorithm based on correction code is proposed,which uses node selection strategy to select the central node as the root node in the new node.The maximum repair tree is constructed with the supply node and the remaining new node according to the link bandwidth,so as to reduce the data repair time.The experimental results show that,compared with the existing BHS and SSR serial repair methods,the algorithm can effectively improve the repair efficiency of multi-failure nodes,which verifies the validity of the proposed algorithm.

关 键 词：纠删码 链路带宽 中心节点 多节点失效 最大修复树 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]