Comparative analysis of task scheduling in multi-tier fog-cloud computing: from classical approaches to greedy multi-objective optimization

Abstract Fog computing extends cloud services to the network edge, enabling low-latency processing for time-sensitive applications. However, scheduling complexity significantly increases due to heterogeneous resources, dynamic workloads, and strict Quality-of-Service (QoS) constraints. Although numerous scheduling techniques have been proposed, existing studies often assess only a narrow subset of algorithms or rely on offline metaheuristics unsuitable for real-time environments. This paper presents a comprehensive comparative evaluation of twelve scheduling algorithms, including five classical, one heuristic, and six metaheuristic-inspired approaches, within a realistic 20-node multi-tier fog-cloud topology. Across 1,365 experiments spanning seven utilization levels, we analyze each algorithm’s deadline adherence, load distribution, and scheduling efficiency. We adapt RT-MOMFO, a real-time variant of Multi-Objective Moth-Flame Optimization (Salehnia et al., 2023), for online fog scheduling through parameter reduction (population=20, iterations=8), ready queue management, and periodic tier preference cycling. This engineering adaptation achieves an 8.1% deadline miss ratio at U=0.8 with near-perfect load balance (0.988), ranking second overall. We also develop GMO (Greedy Multi-Objective), a lightweight greedy scheduler that eliminates population-based mechanisms while retaining load-aware routing and periodic tier cycling. GMO achieves a 9.4% DMR at U=0.8 with 47 times faster decisions (2 ms vs. 94 ms), demonstrating that speed advantages can offset algorithmic simplicity. The results establish a clear performance hierarchy, highlight the importance of explicit fog-cloud tier management, and show that simple greedy approaches remain competitive when perfect load balance is prioritized. Statistical analysis confirms top-tier algorithms (GAMMR, PSG-M, RT-MOMFO) are statistically indistinguishable at critical utilizations, with comprehensive ablation studies validating each design choice. This study provides one of the most extensive evaluations to date with rigorous statistical validation.

Authors

Institutions

Publication Details

Journal
Journal of King Saud University - Computer and Information Sciences
Published
2026-03-24
DOI
https://doi.org/10.1007/s44443-026-00649-y
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparative analysis of task scheduling in multi-tier fog-cloud computing: from classical approaches to greedy multi-objective optimization

Nadim Haque, Zafril Rizal M Azmi, Saydul Akbar Murad
Journal of King Saud University - Computer and Information Sciences
IoT and Edge/Fog Computing
article

Comparative analysis of task scheduling in multi-tier fog-cloud computing: from classical approaches to greedy multi-objective optimization

Nadim Haque, Zafril Rizal M Azmi, Saydul Akbar Murad
article en

Abstract

Abstract Fog computing extends cloud services to the network edge, enabling low-latency processing for time-sensitive applications. However, scheduling complexity significantly increases due to heterogeneous resources, dynamic workloads, and strict Quality-of-Service (QoS) constraints. Although numerous scheduling techniques have been proposed, existing studies often assess only a narrow subset of algorithms or rely on offline metaheuristics unsuitable for real-time environments. This paper presents a comprehensive comparative evaluation of twelve scheduling algorithms, including five classical, one heuristic, and six metaheuristic-inspired approaches, within a realistic 20-node multi-tier fog-cloud topology. Across 1,365 experiments spanning seven utilization levels, we analyze each algorithm’s deadline adherence, load distribution, and scheduling efficiency. We adapt RT-MOMFO, a real-time variant of Multi-Objective Moth-Flame Optimization (Salehnia et al., 2023), for online fog scheduling through parameter reduction (population=20, iterations=8), ready queue management, and periodic tier preference cycling. This engineering adaptation achieves an 8.1% deadline miss ratio at U=0.8 with near-perfect load balance (0.988), ranking second overall. We also develop GMO (Greedy Multi-Objective), a lightweight greedy scheduler that eliminates population-based mechanisms while retaining load-aware routing and periodic tier cycling. GMO achieves a 9.4% DMR at U=0.8 with 47 times faster decisions (2 ms vs. 94 ms), demonstrating that speed advantages can offset algorithmic simplicity. The results establish a clear performance hierarchy, highlight the importance of explicit fog-cloud tier management, and show that simple greedy approaches remain competitive when perfect load balance is prioritized. Statistical analysis confirms top-tier algorithms (GAMMR, PSG-M, RT-MOMFO) are statistically indistinguishable at critical utilizations, with comprehensive ablation studies validating each design choice. This study provides one of the most extensive evaluations to date with rigorous statistical validation.

Journal of King Saud University - Computer and Information Sciences
Universiti Malaysia Pahang Al-Sultan Abdullah (MY), University of Southern Mississippi (US)
Openalex Percentile: Top 11%
IoT and Edge/Fog Computing
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.