摘要：

针对现有纠删码修复方法开销大、效率低的问题,提出一种低成本多点失效修复方法。通过基于网路距离的节点选择算法增加节点之间的可用带宽,采用多线程以及流水线的数据传输方法提高多节点失效修复效率,同时使用基于中心节点的多点修复方法降低多节点失效修复开销。实验结果表明,与基于星型结构的串行修复策略、基于树型结构的串行修复策略和最小存储再生码相比,该方法多点修复效率较高,平均修复时间分别减少了25%,16%和20%。

关键词: 分布式存储, 纠删码, 修复开销, 修复时间, 多节点失效

Abstract:

Current erasure code repair methods have problems such as high expenses and low efficiency.Aiming at these problems,this paper brings forward a multi-node failure repair method with low cost.By means of network distance based node choosing method,available bandwidth between nodes is enhanced.Data transmission method with multithreading and pipeline is adopted for the purpose of improving multi-node failure repair efficiency.Central node based multi-node repair method is utilized for decreasing multi-node repair cost.Experimental results show that,compared with current Star-like Structure Based Serial Repair(SSR) strategy,Tree-like Structure Based Serial Repair(TSR) strategy and Minimum Storage Regenerating(MSR) codes,the proposed method has higher multi-node repair efficiency,and it can reduce the average repair time by 25%,16% and 20%,respectively.

Key words: distributed storage, erasure codes, repair cost, repair time, multi-node failure

中图分类号: 

• TP393