Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
Mahdaviani, K., Mohajer, S., Khisti, A.: Product matrix msr codes with bandwidth adaptive exact repair. IEEE Trans. Inf. Theory 64(4), 3121–3135 (2018)
Li, J., Wang, X., Li, B.: Pipelined regeneration with regenerating codes for distributed storage systems, pp. 1–6 (2011)
Li, J., Li, B.: Beehive: erasure codes for fixing multiple failures in distributed storage systems, pp. 6–6 (2015)
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)
Xu, L., Pavlo, A., Sengupta, S., Li, J., Ganger, G.R.: Reducing replication bandwidth for distributed document databases, pp. 222–235 (2015)
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)
Itani, M., Sharafeddine, S., Elkabani, I.: Dynamic multiple node failure recovery in distributed storage systems. Ad Hoc Netw. 72, 1–13 (2017)
Acknowledgments
This work has been supported in part by the National Natural Sciences Foundation of China (NSFC) under Grants 61501140, 61701136, and 61525103.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, N., Wang, Y., Yu, J., Chen, S. (2020). Multi-node Repair Based on GA\(\_\)PSO with Fractional Regenerating Code Combined with Prior Replication. In: Liang, Q., Liu, X., Na, Z., Wang, W., Mu, J., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2018. Lecture Notes in Electrical Engineering, vol 517. Springer, Singapore. https://doi.org/10.1007/978-981-13-6508-9_32
Download citation
DOI: https://doi.org/10.1007/978-981-13-6508-9_32
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-6507-2
Online ISBN: 978-981-13-6508-9
eBook Packages: EngineeringEngineering (R0)