A Method of Searching for Optimal Coalition Structure for Solving Resource Scheduling Problem of Overall Load Balancing in Edge Computing Environments

Abstract

Abstract The cooperative computing resource scheduling problem in the distributed computing environment is usually transformed into the problem about how to find the optimal coalition structure. However, affected by factors such as high node density and large number of concurrent tasks in edge computing environments, it is difficult to formulate resource scheduling schemes for overall load balancing in a large strategic space by traditional methods. In order to solve this problem, we proposed a method of searching for optimal coalition structure based on discrete particle swarm optimization (DPSO). Firstly, we converted the resource scheduling problem of edge computing into an optimization problem model, constructed a new structure of coalition structure to express the resource scheduling scheme, and gave key elements such as optimization objectives, decision variables, and constraint conditions. Secondly, we improved DPSO and designed M-ary discrete particle swarm optimization (MDPSO): improved particle state determination method for adapting to the new expression of the coalition structure, and proposed a power series-based inertia weight computing method to improve the optimization speed and the optimal solution quality. Finally, we simulated real application scenarios and designed comparative experiments on the optimization speed, the optimal solution quality, stability, etc., which verifies that the method proposed in this paper has obvious advantages in solving the resource scheduling problem of overall load balancing in edge computing.