Optimizing resource utilization in cloud and fog computing environments using Hidden Markov Model
Abstract The massive volumes of data IoT devices generate are processed on the cloud. Fog computing, a hybrid cloud, and IoT solution, is used to distribute workloads and allocate resources efficiently, but it requires much research to implement. The study investigates load balancing in fog and clou...
Saved in:
Published in | Journal of physics. Conference series Vol. 2852; no. 1; pp. 12004 - 12011 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Bristol
IOP Publishing
01.09.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Abstract The massive volumes of data IoT devices generate are processed on the cloud. Fog computing, a hybrid cloud, and IoT solution, is used to distribute workloads and allocate resources efficiently, but it requires much research to implement. The study investigates load balancing in fog and cloud computing environments, which is crucial for managing IoT data. Cloud computing centralizes data processing and storage in remote storage facilities, whereas fog computing decentralizes functions to intermediary nodes closer to data generation and consumption. This close proximity facilitates optimal bandwidth usage, decrease delay, and faster computing. This study uses Hidden Markov Model (HMM) to examine task behaviour’s across diverse computing nodes and consider resource requirements. This study captures the probabilistic nature of load distribution by constructing emission and transition matrices from observed task dynamics and node-specific information. This research demonstrates the effectiveness of HMM in describing and optimizing load-balancing tactics, HMM play a vital role in optimizing load balancing tactics, as they model resource utilization, providing insights into enhancing resource allocation efficiency within complex computing infrastructures. The accuracy of the proposed method is approximately 92%. |
---|---|
ISSN: | 1742-6588 1742-6596 |
DOI: | 10.1088/1742-6596/2852/1/012004 |