检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:鄢喜爱[1,2] 张大方[1] 杨金民[1] 张波云[2]
机构地区:[1]湖南大学信息科学与工程学院,湖南长沙410082 [2]湖南警察学院信息技术系,湖南长沙410138
出 处:《通信学报》2016年第10期65-74,共10页Journal on Communications
基 金:国家自然科学基金资助项目(No.61472130;No.61471169);国家重点基础研究发展计划("973"计划)基金资助项目(No.2012CB315805);公安部公安理论及软科学研究计划基金资助项目(No.2013LLYJHNST040);湖南省科技厅科研基金资助项目(No.2014FJ3049);网络侦查技术湖南省重点实验室基金资助项目(No.2016WLZC006)~~
摘 要:面向云存储容错系统提出了一种RS再生纠删码,该编码继承了RS编码容多错的可靠性,又能实现容三错的高效性。对RS再生码中单节点故障混合修复方法进行了介绍,并求出了混合修复时磁盘读取数的理论下界。从理论上对RS再生码的存储开销、译码效率、修复带宽进行了性能评估。实验结果表明,RS再生纠删码比同类纠删码的修复性能有较大的提升,特别是采用混合修复算法以后,系统单故障恢复时间下降20.8%~28.2%。RS(Reed-Solomon) regenerating erasure codes was proposed for cloud storage fault-tolerant system, which not only inherited the reliability of the RS encoding, but also achieved the high efficiency of tolerance three faults. Hybrid re- covery method of the single fault node based on RS regenerating erasure codes was introduced. And the theoretical lower bound of the number of accessing disks was computed. In theory, the performance evaluation of the storage overhead, de- coding efficiency, and repair bandwidth of the RS regenerating erasure codes was carried out. Experiments results show that the repair performance of RS regenerating erasure codes is improved greatly than the similar erasure codes, and the total re- covery time of the system is reduced by 20.8%-28.2% using hybrid recovery algorithm in the case of single fault.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200