计算机应用研究2018，Vol.35Issue(2)：527-531,5.DOI:10.3969/j.issn.1001-3695.2018.02.044
新多节点修复模型下的再生码
Regenerating codes for new multi-node repair model
摘要
Abstract
As for the model of single node repair problem,Dimakis clarified the tradeoff between the node storage capacity and repair bandwidth by using information flow graph.In case of multiple-node recovery,Shum and Hu proposed the model of mutual cooperation among nodes to be repaired,and characterized the storage-bandwidth tradeoff.Zhang et al.introduced the new multi-node repaired model,in which the newcomers no longer exchanged data symbols among themselves.This new model reduced the complexity of design and operation,so it was more suitable for the demands of the actual system.For this new model,it used an easier way to find out the minimum capacity of the cut-set,and analyzed the theoretical bound on the storagebandwidth by using the method of linear programming.Finally,the regeneration codes were constructed for some special cases.关键词
分布式存储/多节点修复/修复模型/再生码Key words
distributed storage/multi-node repair/repair model/regenerating codes分类
信息技术与安全科学引用本文复制引用
王丽莎,唐小虎..新多节点修复模型下的再生码[J].计算机应用研究,2018,35(2):527-531,5.基金项目
博士点基金优先发展领域课题(20120184130002) （20120184130002）
国家“863”计划项目5G二期课题(2015AA01A710) （2015AA01A710）
