论文部分内容阅读
针对分布式存储中多节点再生修复的修复带宽和可靠性问题,提出了一种具有健康节点协作的多节点修复方案.该方案在修复模型上做出了相应改进,通过健康节点间的协作把上述问题做了折中.给出了具体的多节点修复过程和相应再生码的构造,用信息流图求得最大流最小割集来说明其最小边界.结果表明,在确保修复带宽最低的条件下使修复时间同步,修复过程更简便,最重要的是所需传输信道更少,保证了修复的可靠性.
Aiming at the problem of repair bandwidth and reliability of multi-node regeneration repair in distributed storage, a multi-node repair scheme with health node cooperation is proposed. The scheme is improved on the restoration model, and through the cooperation of healthy nodes The above problem is compromised, and the concrete multi-node repair process and the construction of the corresponding regenerative code are given, and the minimum boundary of the maximum flow is obtained by using the information flow graph.The results show that under the condition of ensuring the lowest repair bandwidth Under the repair time synchronization, repair process easier, the most important is the need to transport fewer channels to ensure the reliability of the repair.