.png){kind=icon}
返回
Optimal sequential computation offloading and migration in mobile edge computing with multi-task priority
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-025-01477-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mobile edge computing (MEC) solves the problem of limited resources by offloading computation-intensive tasks to edge servers. However, as important factors affecting offloading decisions, task priority and migration strategy are often overlooked. This paper considers a MEC system with multiple servers and multi-priority tasks, aiming to minimize the completion delay of low-priority tasks by constructing a task offloading and migration model. Each server has two priority queues, one for high-priority tasks and another for low-priority tasks, both priority tasks arrive randomly. The migration behavior of low-priority tasks among multiple edge servers is modeled using PRP M/G/1 queuing model. Furthermore, the task offloading and migration problem is formulated as a sequential decision-making problem, and an algorithm based on dynamic programming is designed to find the optimal offloading and migration strategy. Through simulation experimental analysis, the algorithm proposed in this paper has better performance in reducing task completion delay and migration times compared with RSAS, MTCC and PSO.
Keyword:
Mobile edge computing
Task priority
Computation offloading
Task migration
Dynamic programming
