Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes
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 Thre...
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-01-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-88197-9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832571709670031360 |
|---|---|
| author | Dinesh Sahu Nidhi Rajnish Chaturvedi Shiv Prakash Tiansheng Yang Rajkumar Singh Rathore Lu Wang Sabeen Tahir Sheikh Tahir Bakhsh |
| author_facet | Dinesh Sahu Nidhi Rajnish Chaturvedi Shiv Prakash Tiansheng Yang Rajkumar Singh Rathore Lu Wang Sabeen Tahir Sheikh Tahir Bakhsh |
| author_sort | Dinesh Sahu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-26484ef39e9d42c2881fbca50b03ee88 |
| institution | Kabale University |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-26484ef39e9d42c2881fbca50b03ee882025-02-02T12:23:22ZengNature PortfolioScientific Reports2045-23222025-01-0115112110.1038/s41598-025-88197-9Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processesDinesh Sahu0Nidhi1Rajnish Chaturvedi2Shiv Prakash3Tiansheng Yang4Rajkumar Singh Rathore5Lu Wang6Sabeen Tahir7Sheikh Tahir Bakhsh8SCSET, Bennett UniversitySCSET, Bennett UniversitySCSET, Bennett UniversityDepartment of Electronics and Communication, University of AllahabadUniversity of South Wales PontypriddCardiff School of Technologies, Cardiff Metropolitan UniversityXi’an Jiaotong-Liverpool University SuzhouCardiff School of Technologies, Cardiff Metropolitan UniversityCardiff School of Technologies, Cardiff Metropolitan UniversityAbstract 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.https://doi.org/10.1038/s41598-025-88197-9Edge computingResource schedulingLoad balancingProbabilistic cellular automataMarkov decision processesLoad harmony |
| spellingShingle | Dinesh Sahu Nidhi Rajnish Chaturvedi Shiv Prakash Tiansheng Yang Rajkumar Singh Rathore Lu Wang Sabeen Tahir Sheikh Tahir Bakhsh Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes Scientific Reports Edge computing Resource scheduling Load balancing Probabilistic cellular automata Markov decision processes Load harmony |
| title | Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes |
| title_full | Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes |
| title_fullStr | Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes |
| title_full_unstemmed | Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes |
| title_short | Revolutionizing load harmony in edge computing networks with probabilistic cellular automata and Markov decision processes |
| title_sort | revolutionizing load harmony in edge computing networks with probabilistic cellular automata and markov decision processes |
| topic | Edge computing Resource scheduling Load balancing Probabilistic cellular automata Markov decision processes Load harmony |
| url | https://doi.org/10.1038/s41598-025-88197-9 |
| work_keys_str_mv | AT dineshsahu revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT nidhi revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT rajnishchaturvedi revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT shivprakash revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT tianshengyang revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT rajkumarsinghrathore revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT luwang revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT sabeentahir revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses AT sheikhtahirbakhsh revolutionizingloadharmonyinedgecomputingnetworkswithprobabilisticcellularautomataandmarkovdecisionprocesses |