Study on Load Balancing Based on Dynamic Local Repair Codes in Distributed Storage
In distributed storage systems,there is often an imbalance in data access.Most access is concentrated on a small portion of the da-ta,which can cause the system's load to be unbalanced,leading to some high load nodes becoming the performance bottleneck of the entire system.In response to the system load imbalance caused by this issue,this article proposes a dynamic local repair code(ALRC)for load bal-ancing.This encoding scheme establishes the priority of hot and cold data through historical heat,and dynamically adjusts the layout of hot and cold data through(r,t)-availability properties,allowing the data to have additional access paths,thereby improving the parallel access performance of hot data,system load balancing,and taking into account certain storage efficiency.According to the simulation experiment re-sults,it is shown that when the system load is relatively unbalanced,ALRC only needs a small amount of additional storage overhead com-pared to before encoding,which can improve the load balance by more than 53％compared to the original scheme,thereby helping to ensure uniform load distribution between nodes and improving the performance and reliability of the entire system.
distributed storagehot and cold dataload balancinglocal repair codeparallel access
万方数据
维普
