TY - GEN
T1 - Cost-minimized User Association and Partial Offloading for Dependent Tasks in Hybrid Cloud-edge Systems
AU - Yuan, Haitao
AU - Hu, Qinglong
AU - Wang, Meijia
AU - Bi, Jing
AU - Zhou, Meng Chu
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Edge nodes (ENs) in mobile edge computing can support current delay-sensitive applications of the Industrial Internet of Things. ENs are deployed in the network edge and can execute computational tasks offloaded from users' mobile devices (MDs) in a timely way. However, their computing and communication resources are limited and cannot execute all offloaded tasks. Thus, a cloud data center (CDC) is highly needed and hybrid cloud-edge systems emerge to provide low-delay services. This work investigates a joint optimization problem of task offloading, task partitioning, and user association to minimize the total cost of the system. This work focuses on applications that can be split into multiple dependent subtasks, each of which can be completed in MDs, ENs, and CDC. Specifically, a mixed integer nonlinear program is formulated to minimize the total cost. Then, a hybrid algorithm named Genetic Simulated-annealing-based Particle Swarm Optimizer (GSPSO) is designed to solve it. GSPSO yields a close-to-optimal strategy to jointly optimize connections among MDs and ENs, and allocation ratios among MDs, ENs, and CDC. Experimental results demonstrate that compared with benchmark methods, GSPSO decreases the total cost while fully meeting the completion time requirements of user tasks.
AB - Edge nodes (ENs) in mobile edge computing can support current delay-sensitive applications of the Industrial Internet of Things. ENs are deployed in the network edge and can execute computational tasks offloaded from users' mobile devices (MDs) in a timely way. However, their computing and communication resources are limited and cannot execute all offloaded tasks. Thus, a cloud data center (CDC) is highly needed and hybrid cloud-edge systems emerge to provide low-delay services. This work investigates a joint optimization problem of task offloading, task partitioning, and user association to minimize the total cost of the system. This work focuses on applications that can be split into multiple dependent subtasks, each of which can be completed in MDs, ENs, and CDC. Specifically, a mixed integer nonlinear program is formulated to minimize the total cost. Then, a hybrid algorithm named Genetic Simulated-annealing-based Particle Swarm Optimizer (GSPSO) is designed to solve it. GSPSO yields a close-to-optimal strategy to jointly optimize connections among MDs and ENs, and allocation ratios among MDs, ENs, and CDC. Experimental results demonstrate that compared with benchmark methods, GSPSO decreases the total cost while fully meeting the completion time requirements of user tasks.
KW - Edge computing
KW - cloud computing
KW - computation offloading
KW - genetic algorithm
KW - particle swarm optimization
UR - http://www.scopus.com/inward/record.url?scp=85141730051&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85141730051&partnerID=8YFLogxK
U2 - 10.1109/CASE49997.2022.9926426
DO - 10.1109/CASE49997.2022.9926426
M3 - Conference contribution
AN - SCOPUS:85141730051
T3 - IEEE International Conference on Automation Science and Engineering
SP - 1059
EP - 1064
BT - 2022 IEEE 18th International Conference on Automation Science and Engineering, CASE 2022
PB - IEEE Computer Society
T2 - 18th IEEE International Conference on Automation Science and Engineering, CASE 2022
Y2 - 20 August 2022 through 24 August 2022
ER -