面向纠删码的低成本多节点失效修复方法

发布时间：2018-02-02 14:22

本文关键词： 分布式存储纠删码修复开销修复时间多节点失效　出处：《计算机工程》2017年07期 　论文类型：期刊论文

【摘要】：针对现有纠删码修复方法开销大、效率低的问题,提出一种低成本多点失效修复方法。通过基于网路距离的节点选择算法增加节点之间的可用带宽,采用多线程以及流水线的数据传输方法提高多节点失效修复效率,同时使用基于中心节点的多点修复方法降低多节点失效修复开销。实验结果表明,与基于星型结构的串行修复策略、基于树型结构的串行修复策略和最小存储再生码相比,该方法多点修复效率较高,平均修复时间分别减少了25%,16%和20%。
[Abstract]:Aiming at the problem of high cost and low efficiency of existing erasure repair methods, a low cost multipoint failure repair method is proposed, which increases the available bandwidth between nodes by node selection algorithm based on network distance. Multi-thread and pipeline's data transmission method are used to improve the efficiency of multi-node failure repair, and the central node based multi-point repair method is used to reduce the cost of multi-node failure repair. The experimental results show that. Compared with the serial repair strategy based on star structure, the serial repair strategy based on tree structure and the minimum memory regenerative code, this method is more efficient and the average repair time is reduced by 25% respectively. 16% and 20.
【作者单位】：武警警官学院电子技术系;武警警官学院科研部;
【基金】：国家“973”计划项目“高效可信的虚拟计算环境基础研究”(2011CB302601)
【分类号】：TP333
【正文快照】： 中文引用格式:郑力明,李晓冬.面向纠删码的低成本多节点失效修复方法[J].计算机工程,2017,43(7):110-118,123.英文引用格式:Zheng Liming,Li Xiaodong.Low-cost Multi-node Failure Repair Method for Erasure Codes[J].Computer Engineering,2017,43(7):110-118,123.0概述随

【参考文献】