Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes

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.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-01-29
DOI
https://doi.org/10.1038/s41598-025-88197-9
Citations
15
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
22.31
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes

Sheikh Tahir Bakhsh, Rajkumar Singh Rathore, Nidhi Nidhi, Sabeen Tahir et al.
15 citations
Scientific Reports
IoT and Edge/Fog Computing
22.31
article

Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes

Sheikh Tahir Bakhsh, Rajkumar Singh Rathore, Nidhi Nidhi, Sabeen Tahir, Rajnish Kumar Chaturvedi, Tiansheng Yang, Shiv Prakash, Dinesh Kumar Sahu, Lu Wang
article en
15 citations

Abstract

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.

Scientific ReportsVol. 15(1)
University of South Wales (GB), University of Allahabad (IN), Bennett University (IN), Xi’an Jiaotong-Liverpool University (CN), Cardiff Metropolitan University (GB)
Decent work and economic growth
Openalex Percentile: Top 1%
IoT and Edge/Fog Computing
22.31
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.