新多节点修复模型下的再生码

Regenerating codes for new multi-node repair model

关于单节点修复模型,Dimakis已通过信息流图分析出节点存储与修复带宽的理论界。对于多节点的修复,Shum和Hu提出了新节点之间相互合作的模型,并给出此模型下存储与带宽的理论界;Zhang等人介绍的新节点之间不再传输数据的模型,比合作修复减少了设计和运算的复杂性,更符合系统的需要。针对这种新模型,利用割型找出其最小容量割,并用线性规划的方法给出存储—带宽的理论界,过程更为简单。最后给出一些特殊参数下的编码构造。

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 muhiple-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 mo- del, 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.