Global Resource Scheduling for Distributed Edge Computing

Recently, there has been a surge in interest surrounding the field of distributed edge computing resource scheduling. Notably, applications like intelligent traffic systems and Internet of Things (IoT) intelligent monitoring necessitate the effective scheduling and migration of distributed resources. In addressing this challenge, distributed resource scheduling must weigh the costs associated with resource scheduling, aiming to identify an optimal strategy amid various feasible solutions. Different application scenarios introduce diverse optimization objectives, including considerations such as cost, transmission delay, and energy consumption. While current research predominantly focuses on the optimization problem of local resource scheduling, there is a recognized need for increased attention to global resource scheduling. This paper contributes to the field by defining a global resource scheduling problem for distributed edge computing, demonstrating its NP-Hard nature through proof. To tackle this complex problem, the paper proposes a heuristic solution strategy based on the ant colony algorithm (ACO), with optimization of ACO parameters achieved through the use of particle swarm optimization (PSO). To assess the effectiveness of the proposed algorithm, an experimental comparative analysis is conducted. The results showcase the algorithm's notable accuracy and efficient iteration cost performance, highlighting its potential applicability and benefits in the realm of distributed edge computing resource scheduling.