.png){kind=icon}
Return
System delay optimization for Mobile Edge Computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2020.03.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile edge computing (MEC) has emerged as an effective paradigm that delivers cloud services and functions to edge devices, with the objective to further enhance quality of service (QoS) of terminal users by offloading their computation-intensive tasks. In this article, a multi-user and multi-server MEC system is considered and each user can choose one MEC server to execute its computation task. We try to minimize the system delay (i.e., the maximum server delay). The problem is decomposed into task offloading problem and transmit power allocation problem which are solved by matching theory and a heuristic idea, respectively. The experimental results show that the proposed algorithm can not only obtain less delay, but also generate less energy consumption compared with the decomposed computation offloading and resource allocation algorithm, the shortest distance based scheduling algorithm and the random scheduling algorithm, especially when the data amount of tasks is the same but the workload is random. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Mobile edge computing
Matching theory
Resource allocation
Task offloading scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveUnderstanding Graph-Based Trust Evaluation in Online Social Networks: Methodologies and Challenges
PREAI
ShareSaveShareSaveShareSave
View more