In general, edge computing networks are based on a distributed computing environment and hence, present some difficulties to obtain an appropriate load balancing, especially under dynamic workload and limited resources. The conventional approaches of Load balancing like Round-Robin and Threshold-based load balancing fails in scalability and flexibility issues when applied to highly variable edge environments. To solve the problem of how to achieve steady-state load balance and provide dynamic adaption to edge networks, this paper proposes a new framework that using PCA and MDP. Taking advantage of the stochasticity of PCA classification our model describes interactions between neighboring nodes in terms of a local load thus allowing for a distributed, self-organizing approach to load balancing. The MDP framework then determines each node’s decision-making with the focus on load offloading policies that are aligned with rewards that promote per node balance and penalties for offloading a larger load than it can handle.These models are then incorporated into our proposed PCA-MDP system to achieve dynamic load balancing with low variability in resource usage among nodes. By conducting a large number of experiments, we prove that the proposed PCA-MDP model yields a higher efficiency in the distribution of the load, higher stabilities of the reward function, and a faster convergence speed compared to the existing approaches. Key performance parameters, such as load variance, convergence time, and scalability, validate the robustness of the proposed model. Besides optimizing resource exploitation, load harmony in edge computing networks helps provide efficient work progression and minimize latency, thereby contributing to the advancement of the field with respect to real-time applications such as self-driving vehicles and the Internet of Things. The presented work offers an excellent foundation for the next-generation edge-computing load-balancing solution that can be easily scaled up.
Read full abstract