去中心化云存储网络的存储任务分配算法  

Storage Task Allocation Algorithm in Decentralized Cloud Storage Network

作　　者：申圳 赵成贵[1] SHEN Zhen;ZHAO Cheng-gui(School of Information Science,Yunnan University of Finance and Economics,Kunming 650221,China)

机构地区：[1]云南财经大学信息学院,昆明650221

出　　处：《计算机科学》2022年第12期17-21,共5页Computer Science

基　　金：国家自然科学基金(61562089)。

摘　　要：针对联邦学习客户端数据集的存储任务分配问题构建新型模型,为保证去中心化云存储网络的负载均衡,缩短存储数据上传/恢复时间,减少客户端存储总花费,提出了一种考虑客户端需求和全局负载的数据存储任务分配算法——URGL_allo(Allocation Based on User Requirements and Global Load)算法。在节点分配阶段考虑全局负载、拓扑属性及客户端关注的存储价格和数据恢复时间等节点资源,结合万有引力定律定义新的节点排序方法,选择最佳存储任务分配节点。在链路分配阶段,使用Dijkstra算法计算以客户端节点为中心到网络中其他节点的最短路径,并选择两节点间最短路径集合中带宽值最大的路径进行分配。仿真结果表明,相比基于随机策略的分配算法(Random_allo),所提算法的负载均衡指数、客户端存储总花费分别降低了41.9%,5%,并且与基于链路带宽的贪婪算法的数据恢复时间相差不大,都稳定维持在(0,2]之间,是Random_allo算法的1/20,在全局负载和服务质量上的综合表现优于对比算法。Constructing a novel model for the storage task allocation problem of federated learning client datasets,to ensure load balancing of decentralized cloud storage networks,shorten the storage data uploading and recovery time,and reduce the total client storage cost,a data storage task allocation algorithm——URGL_allo(allocation based on user requirements and global load)that considers client requirements and global load is proposed.In the node allocation phase,node resources such as global load,topological attributes,storage price and data recovery time concerned by clients are considered,and a new node ranking method is defined in conjunction with the law of gravity to select the best storage task allocation node.In the link allocation stage,the shortest path calculation is performed using Dijkstra’s algorithm for the client node as the center to other nodes in the network,and the path with the largest bandwidth value in the set of shortest paths between two nodes is selected for allocation.Simulation results show that the proposed algorithm reduces the load balancing index and the total client storage cost by 41.9%and 5%,respectively,compared with the random policy-based allocation algorithm(Random_allo),and the data recovery time is not much different from that of the link bandwidth-based greedy algorithm,both of which are stably maintained between(0,2],which is 1/20 of Random_allo.The combined performance of global load and service quality is better than that of the comparison algorithm.

关 键 词：联邦学习 去中心化云存储 存储任务分配 全局负载 客户端需求 节点排序 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]