To address inaccurate recovery-node selection caused by dynamically varying node resources,path-cost and forwarding-load imbalance over heterogeneous links,and limited parallel execution of multi-hop tasks under node-exclusive constraints in erasure-coded distributed storage recovery,a failure recovery method based on dynamic resource awareness and parallel repair-tree scheduling is proposed.A six-dimensional node-state evolution model is established,and subjective and objective weights are determined by combining the analytic hierarchy process with the entropy-weight method.The Technique for order preference by similarity to ideal solution is then employed to develop a dynamic resource-aware recovery node selection (DRRNS) method,enabling the dynamic evaluation and selection of recovery nodes.A time-aware repair tree is constructed by considering node scores,link quality,cumulative transmission costs,and forwarding loads.Critical-path-priority scheduling is adopted to estimate the theoretical parallel makespan,thereby improving the adaptability of recovery-node selection to resource variations and the parallel efficiency of multi-hop recovery tasks.Simulation results under RS(9,6),RS(12,8),and RS(15,10) configurations show that the proposed method reduces the average theoretical parallel makespan by 28.06%-60.01% compared with four end-to-end combined baselines,demonstrating the effectiveness of jointly optimizing dynamic node selection,repair-tree construction, and parallel scheduling.
关键词
Keywords
references
Shen Z R , Cai Y H , Cheng K Y , et al . A survey of the past,present,and future of erasure coding for storage systems [J ] . ACM Transactions on Storage , 2025 , 21 ( 1 ): 1 - 39 .
Lucas Filho E R , Efstathiou A , Yang L , et al . DITIS:an end-to-end system-level simulator and optimizer for distributed tiered storage [J ] . SN Computer Science , 2025 , 6 ( 6 ): 746 .
Li J , Zhou Z R , Ding J L . Data-loss models for proactive-tolerance Reed-Solomon storage systems [J ] . Future Generation Computer Systems , 2025 , 170 : 107832 .
Chen J M , Li Z P , Fang G , et al . A comprehensive repair scheme for distributed storage systems [J ] . Computer Networks , 2023 , 235 : 109954 .
Chen N J , Liu W T , Pu W J , et al . SDNC-repair:a cooperative data repair strategy based on erasure code for software-defined storage [J ] . Sensors , 2023 , 23 ( 13 ): 5809 .
Xia J X , Luo L L , Sun B W , et al . Parallelized in-network aggregation for failure repair in erasure-coded storage systems [J ] . IEEE/ACM Transactions on Networking , 2024 , 32 ( 4 ): 2888 - 2903 .
Liu L , Wang Y , Liang Y F , et al . In-network aggregation enabled multiple sub-blocks parallel repair in erasure-coded storage system [J ] . Computer Networks , 2025 , 270 : 111523 .
Yang C H , Zhong K , Tan Y J , et al . RAN:accelerating data repair with available nodes in erasure-coded storage [C ] // Proc of 2025 IEEE International Conference on Cluster Computing . Piscataway,NJ : IEEE , 2025 : 1 - 12 .
Liu X Z , Hu Y C , Feng D , et al . Repair friendly wide-stripe erasure coding for in-memory key-value stores [J ] . Journal of Systems Architecture , 2025 , 167 : 103516 .
Zhou Z J , Deng X H , Pei X J , et al . ZJC:constructing fully local repair in erasure codes for distributed cloud storage [J ] . Journal of Systems Architecture , 2026 , 174 : 103735 .
Liu X Z , Hu Y C , Wang W C , et al . Optimizing encoding and repair for wide-stripe minimum bandwidth regenerating codes in in-memory key-value stores [J ] . Journal of Systems Architecture , 2025 , 161 : 103369 .