Mobile edge computing scheduling algorithm based on minimum total delay-time

Abstract

As an emerging architecture, mobile edge computing (MEC) extends cloud computing services to network edges close to users through MEC servers, satisfying the application needs of real-time control and real-time data analysis. However, due to the limited computing power of MEC server, the task has a long delay-time. In order to improve the current situation, this paper proposes a scheduling algorithm of minimum total delay-time (MTD), in which the server determines the optimal order of task computation to MTD. In addition, this paper proposes an incentive mechanism for users to submit tasks with reasonable computation and expected completion time, while reducing the number and computation of submitted tasks when server computing resources are insufficient. The results show that the performance of the algorithm is close to that of the traditional scheduling algorithm, and total delay-time and average delay-time have improved by 17% to 200%.