Task Scheduling in Mobile Edge Computing with Stochastic Requests and M/M/1 Servers
Yuchong Luo, Jigang Wu, Yalan Wu, Long Chen · 2019
A multi-user mobile edge computing system with stochastic requests and M/M/1 queuing based servers is proposed in this paper. The problem of minimizing the total response time of all tasks is formulated, which is proved to be NP-complete. A greedy algorithm is proposed to solve the mentioned optimization problem, which prefers to assign task to the server with minimum response time for the task. Simulation results show that, the average response time of tasks in the proposed greedy algorithm is saved by 20%-30%, in comparison to the proposed random algorithm. Meanwhile, the average response time of tasks in customized tabu search is decreased by 8.5%, compared to the greedy algorithm.