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

Abstract: 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. 

Key words: correction code, link bandwidth, center node, multi-node failure, maximum repair tree