Article (Scientific journals)
Hybrid Markov chain-based dynamic scheduling to improve load balancing performance in fog-cloud environment
KHALEDIAN, Navid; Razzaghzadeh, Shiva; Haghbayan, Zeynab et al.
2025In Sustainable Computing: Informatics and Systems, 45, p. 101077
Peer reviewed
 

Files


Full Text
Markov chain.pdf
Author postprint (5.94 MB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Arithmetic Optimization Algorithm; Fog computing; Load balancing; Markov chain; Task scheduling; Arithmetic optimization algorithm; Cloud environments; Computing paradigm; Dynamic scheduling; Load-Balancing; Low latency; Makespan; Optimization algorithms; Performance; Tasks scheduling; Computer Science (all); Electrical and Electronic Engineering
Abstract :
[en] Fog computing is a distributed computing paradigm that has become essential for driving Internet of Things (IoT) applications due to its ability to meet the low latency requirements of increasing IoT applications. However, fog servers can become overburdened as many IoT applications need to run on these resources, potentially leading to decreased responsiveness. Additionally, the need to handle real-world challenges such as load instability, makespan, and underutilization of virtual machine (VM) devices has driven an exponential increase in demand for effective task scheduling in IoT-based fog and cloud computing environments. Therefore, scheduling IoT applications in heterogeneous fog computing systems effectively and flexibly is crucial. The limited processing resources of fog servers make the application of ideal but computationally costly procedures more challenging. To address these difficulties, we propose using an Arithmetic Optimization Algorithm (AOA) for task scheduling and a Markov chain to forecast the load of VMs as fog and cloud layer resources. This approach aims to establish an environmentally load-balanced framework that reduces energy usage and delay. The simulation results indicate that the proposed method can improve the average makespan, delay, and Performance Improvement Rate (PIR) by 8.29 %, 11.72 %, and 4.66 %, respectively, compared to the crow, firefly, and grey wolf algorithms (GWA).
Precision for document type :
Review article
Disciplines :
Computer science
Author, co-author :
KHALEDIAN, Navid  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > CritiX
Razzaghzadeh, Shiva;  Department of Computer Engineering, Ardabil Branch, Islamic Azad University, Ardabil, Iran
Haghbayan, Zeynab;  Department of Computer Engineering, Ardabil Branch, Islamic Azad University, Ardabil, Iran
VÖLP, Marcus  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > CritiX
External co-authors :
yes
Language :
English
Title :
Hybrid Markov chain-based dynamic scheduling to improve load balancing performance in fog-cloud environment
Publication date :
2025
Journal title :
Sustainable Computing: Informatics and Systems
ISSN :
2210-5379
Publisher :
Elsevier Inc.
Volume :
45
Pages :
101077
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 16 May 2025

Statistics


Number of views
64 (2 by Unilu)
Number of downloads
175 (1 by Unilu)

Scopus citations®
 
12
Scopus citations®
without self-citations
10
OpenCitations
 
0
OpenAlex citations
 
7
WoS citations
 
11

Bibliography


Similar publications



Contact ORBilu