arrow
Return

Integrated Resource Allocation for Sequential Task Offloading in Edge Computing

delete
delete0
PRE
AI
M
Meiyan Teng
X
Xin Li
X
Xuyun Zhang
Y
Yanling Bu
朱琨 (Kun Zhu)
A
Adnan Mahmood
X
Xiangyu Wu
Q
Quan Z. Sheng
DOI:10.1109/TSC.2025.3589122delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In edge computing, end devices (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">EDs</i>) containerize tasks with the necessary resources and offload subsets to a nearby high-capacity edge server (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ES</i>) to improve efficiency. Most existing research focuses on inseparable task offloading to minimize response times or resource allocation to reduce energy consumption. However, task execution can be speeded up with excessive computing and network resources, it will increase energy consumption and incur unnecessarily high costs. Besides, complex applications like autonomous driving often partition sequential tasks to improve performance, necessitating a joint optimization of sequential task offloading and multi-resource allocation. In this paper, we introduce a Stackelberg game-based framework to model the interplay between these elements. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">EDs</i>, acting as leaders, determine the offloading breakpoints of sequential tasks and the locality for processing. The <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ES</i>, as the follower, uses the Karush-Kuhn-Tucker (KKT) conditions and a Boundary-constrained quasi-Particle Swarm Optimization (Bc-qPSO) algorithm to refine computing and network resource allocation, aiming to reduce system costs effectively. Our simulations show that the proposed algorithms reduce cost by approximately 10%-20% compared to traditional methods, highlighting their potential for improving the efficiency of edge computing systems.
Keywords:
Sequential task offloading
resource allocation
Stackelberg game
Karush-Kuhn-Tucker (KKT) condition

Journal

IEEE Transactions on Services Computing cover
IEEE Transactions on Services Computing
IF:
5.8
Papers:
2.1K
Citations:
6.5K

Organization

T
Temple University
Scholars:
1.1W
Papers: 8.8K
Citations: 1.9W
M
Macquarie University
Scholars:
1.2W
Papers: 1.5W
Citations: 2.2W
N
Nanjing University of Aeronautics and Astronautics
Scholars:
7.4K
Papers: 3.1K
Citations: 2.4W
researcher View more organizations