TY - GEN
T1 - Towards Multi-Criteria Heuristic Optimization for Computational Offloading in Multi-Access Edge Computing
AU - Singh, Raghubir
AU - Armour , Simon
AU - Khan, Aftab
AU - Sooriyabandara, Mahesh
AU - Oikonomou, George
PY - 2023/7/15
Y1 - 2023/7/15
N2 - In recent years, there has been considerable interest in computational offloading algorithms. The interest is mainly driven by the potential savings that offloading offers in task completion time and mobile device energy consumption. This paper builds on authors' previous work on computational offloading and describes a multi-objective optimization model that optimizes time and energy in a network with multiple Multi-Access Edge Computing servers (MECs) and Mobile Devices (MDs). Each MD has multiple computational jobs to process, and each task can be processed locally or offloaded to one of the MEC servers. Several heuristic offloading policies are proposed and tested with an objective function with a range of weightings for optimizing time and energy. The approaches are illustrated with the help of three test cases of varying complexity. The objective function shows a continuous variation as the emphasis is placed on either time or energy saving by the weighting factors. The numerical tests demonstrate that the proposed heuristic algorithms produce near-optimal computational offloading solutions while considering a combined weighted score for schedule task completion time and energy.
AB - In recent years, there has been considerable interest in computational offloading algorithms. The interest is mainly driven by the potential savings that offloading offers in task completion time and mobile device energy consumption. This paper builds on authors' previous work on computational offloading and describes a multi-objective optimization model that optimizes time and energy in a network with multiple Multi-Access Edge Computing servers (MECs) and Mobile Devices (MDs). Each MD has multiple computational jobs to process, and each task can be processed locally or offloaded to one of the MEC servers. Several heuristic offloading policies are proposed and tested with an objective function with a range of weightings for optimizing time and energy. The approaches are illustrated with the help of three test cases of varying complexity. The objective function shows a continuous variation as the emphasis is placed on either time or energy saving by the weighting factors. The numerical tests demonstrate that the proposed heuristic algorithms produce near-optimal computational offloading solutions while considering a combined weighted score for schedule task completion time and energy.
U2 - 10.1109/HPSR52026.2021.9481852
DO - 10.1109/HPSR52026.2021.9481852
M3 - Chapter in a published conference proceeding
SN - 9781665440059
T3 - IEEE Workshop on High Performance Switching and Routing
BT - 2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)
ER -