Pareto Ant Colony Algorithm Based Task Offloading Optimization for Functional Safety Critical Applications in Fog Computing
Ensuring reliability and real-time performance of task offloading in fog computing remains a critical challenge. To address this, this article considers a dual-objective optimization problem of reliability and execution time for task offloading in energy-constrained fog computing. We first propose a more realistic fog computing system model that incorporates Rayleigh fading. Second, we introduce a reliability and time balanced Pareto ant colony optimization algorithm (RTPACO) based on the Pareto ant colony optimization (PACO algorithm. This algorithm is specifically designed for task offloading scenarios in fog computing. Lastly, we compared RTPACO with other multiobjective optimization algorithms using several metrics, including convergence and diversity (evenness and spread). To evaluate the performance of the algorithms, we employed the widely-used Hypervolume (HV) metric. The experimental results demonstrate that RTPACO consistently achieves a superior Pareto front, with HV improvements ranging from 17.2% to 50.2% compared to existing algorithms.