Enhancing Dependability of Fog Computing Using Learning-Based Task Scheduling

Fog computing (FC) has emerged as a promising platform for processing delay-sensitive Internet of Things (IoT) tasks. Fog nodes (FNs) are prone to failure, which necessitates the introduction of a mechanism to increase FC dependability. Leveraging a failure-aware task scheduling approach is one way to make FC a dependable platform for IoT task execution. However, the dynamicity, heterogeneity, and execution uncertainty inherent in FC make designing such a system difficult. To this end, we propose a learning-based dynamic fault-tolerant scheduling approach that considers the three intrinsic characteristics of the IoT-Fog environment to improve fog service reliability for time-constrained IoT tasks. The proposed approach provides a hybrid fault-tolerance solution based on proactive, reactive and replication failure handling approaches. It also integrates a dynamic task runtime and energy-awareness in the decision-making to address the dynamicity, uncertainties, and energy consumption challenges in the FC environment. To validate the performance of the proposed fault-tolerant task scheduling approach, we carried out extensive experimental analysis and compared it with several baseline approaches. The proposed task scheduling approach improves fog service reliability, energy efficiency, and resource utilisation compared to baseline methods.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-05-19
DOI
https://doi.org/10.1109/tdsc.2025.3566395
Citations
1
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing Dependability of Fog Computing Using Learning-Based Task Scheduling

Sara Ghanavati, Davood Izadi, Jemal Abawajy
1 citations
IEEE Transactions on Dependable and Secure Computing
IoT and Edge/Fog Computing
1.49
article

Enhancing Dependability of Fog Computing Using Learning-Based Task Scheduling

Sara Ghanavati, Davood Izadi, Jemal Abawajy
article en
1 citations

Abstract

Fog computing (FC) has emerged as a promising platform for processing delay-sensitive Internet of Things (IoT) tasks. Fog nodes (FNs) are prone to failure, which necessitates the introduction of a mechanism to increase FC dependability. Leveraging a failure-aware task scheduling approach is one way to make FC a dependable platform for IoT task execution. However, the dynamicity, heterogeneity, and execution uncertainty inherent in FC make designing such a system difficult. To this end, we propose a learning-based dynamic fault-tolerant scheduling approach that considers the three intrinsic characteristics of the IoT-Fog environment to improve fog service reliability for time-constrained IoT tasks. The proposed approach provides a hybrid fault-tolerance solution based on proactive, reactive and replication failure handling approaches. It also integrates a dynamic task runtime and energy-awareness in the decision-making to address the dynamicity, uncertainties, and energy consumption challenges in the FC environment. To validate the performance of the proposed fault-tolerant task scheduling approach, we carried out extensive experimental analysis and compared it with several baseline approaches. The proposed task scheduling approach improves fog service reliability, energy efficiency, and resource utilisation compared to baseline methods.

IEEE Transactions on Dependable and Secure ComputingVol. 22(6)
Deakin University (AU)
Openalex Percentile: Top 17%
IoT and Edge/Fog Computing
1.49
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.