Multi-node Repair Based on GA\(\_\)PSO with Fractional Regenerating Code Combined with Prior Replication

  • Niannian WangEmail author
  • Ye Wang
  • Jia Yu
  • Siyun Chen
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 517)


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 Fractional regenerating code Multi-node repair GA\(\_\)PSO 



This work has been supported in part by the National Natural Sciences Foundation of China (NSFC) under Grants 61501140, 61701136, and 61525103.


  1. 1.
    Gerami, M., Xiao, M., Skoglund, M.: Two-layer coding in distributed storage systems with partial node failure/repair. IEEE Commun. Lett. 21(4), 726–729 (2017)CrossRefGoogle Scholar
  2. 2.
    Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539–4551 (2007)CrossRefGoogle Scholar
  3. 3.
    Mahdaviani, K., Mohajer, S., Khisti, A.: Product matrix msr codes with bandwidth adaptive exact repair. IEEE Trans. Inf. Theory 64(4), 3121–3135 (2018)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Li, J., Wang, X., Li, B.: Pipelined regeneration with regenerating codes for distributed storage systems, pp. 1–6 (2011)Google Scholar
  5. 5.
    Li, J., Li, B.: Beehive: erasure codes for fixing multiple failures in distributed storage systems, pp. 6–6 (2015)Google Scholar
  6. 6.
    Papailiopoulos, D.S., Luo, J., Dimakis, A.G., Huang, C., Li, J.: Simple regenerating codes: network coding for cloud storage. In: Proceedings - IEEE INFOCOM (2012)Google Scholar
  7. 7.
    Xu, L., Pavlo, A., Sengupta, S., Li, J., Ganger, G.R.: Reducing replication bandwidth for distributed document databases, pp. 222–235 (2015)Google Scholar
  8. 8.
    Hu, Y., Lee, P.P.C., Shum, K.W.: Analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems, pp. 2355–2363 (2012)Google Scholar
  9. 9.
    Itani, M., Sharafeddine, S., Elkabani, I.: Dynamic multiple node failure recovery in distributed storage systems. Ad Hoc Netw. 72, 1–13 (2017)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Communication Engineering Research CenterHarbin Institute of Technology (Shenzhen)ShenzhenChina

Personalised recommendations