| 注册
首页|期刊导航|计算机工程|面向纠删码的低成本多节点失效修复方法

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

郑力明 李晓冬

计算机工程2017,Vol.43Issue(7):110-118,123,10.
计算机工程2017,Vol.43Issue(7):110-118,123,10.DOI:10.3969/j.issn.1000-3428.2017.07.018

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

Low-cost Multi-node Failure Repair Method for Erasure Codes

郑力明 1李晓冬2

作者信息

  • 1. 武警警官学院 电子技术系,成都 610213
  • 2. 武警警官学院 科研部,成都 610213
  • 折叠

摘要

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

分类

信息技术与安全科学

引用本文复制引用

郑力明,李晓冬..面向纠删码的低成本多节点失效修复方法[J].计算机工程,2017,43(7):110-118,123,10.

基金项目

国家"973"计划项目"高效可信的虚拟计算环境基础研究"(2011CB302601). (2011CB302601)

计算机工程

OA北大核心CSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文