首页> 外文会议>International conference on communications, signal processing, and systems >Multi-node Repair Based on GA_PSO with Fractional Regenerating Code Combined with Prior Replication
【24h】

Multi-node Repair Based on GA_PSO with Fractional Regenerating Code Combined with Prior Replication

机译:基于GA_PSO的带分数再生代码并结合先行复制的多节点修复

获取原文

摘要

Erasure codes can improve the reliability of modern Distributed Storage Systems (DSS) by preventing data loss and nodes failure. Regenerating code is a class of erasure codes that allow for repairing of failed nodes. However, regenerating code increases the amount of the participating nodes and its coding parameters are difficult to determine. In addition, it has huge computational overhead and low repair efficiency that prohibit its applications. Hence, we first propose a fractional regenerating code combined with prior replication with uncoded repair. Simulation results show that it can reduce repair bandwidth and computational complexity by increasing the number of high prior nodes. Second, we formulate the problem of computing multiple failure repairs cost using the proposed code as a redundancy scheme. We model the problem as an Integer Linear Programming problem (ILP) and solve it by Genetic Algorithm_Particle Swarm Optimization (GA-PSO) algorithm. We present results of repairing bandwidth cost for our proposed algorithm in two scenarios to evaluate the effectiveness of the solution approaches. Simulation results demonstrate that GA-PSO can get smaller repair bandwidth cost than GA.
机译:擦除代码可通过防止数据丢失和节点故障来提高现代分布式存储系统(DSS)的可靠性。重新生成代码是一类擦除代码,可用于修复故障节点。然而,再生代码增加了参与节点的数量,并且其编码参数难以确定。另外,它具有巨大的计算开销和低修复效率,从而限制了其应用。因此,我们首先提出一个分数再生代码,结合先前的复制和未编码的修复。仿真结果表明,它可以通过增加高优先级节点的数量来减少修复带宽和计算复杂度。其次,我们提出了使用所提出的代码作为冗余方案来计算多次故障维修成本的问题。我们将该问题建模为整数线性规划问题(ILP),并通过遗传算法_粒子群优化(GA-PSO)算法进行求解。我们介绍了在两种情况下为我们提出的算法修复带宽成本的结果,以评估解决方案方法的有效性。仿真结果表明,GA-PSO的维修带宽成本比GA小。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号