Resource Scheduling for Delay Minimization in Multi-Server Cellular Edge Computing Systems

27Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper studies resource scheduling for delay minimization in multi-server cellular edge computing systems. The traditional method defines queue length-based Lyapunov functions and designs scheduling algorithms which solve the corresponding queue length control problem. Different from the traditional method, this paper defines the delay-based Lyapunov function. Specifically, the formulas of the communication delay and computing delay in cellular edge computing systems are derived without needing the assumptions about traffic's statistics. Then, a resource scheduling algorithm which directly minimizes the weighted sum of the communication delay and computing delay is proposed. The simulation results show that the total delay of the proposed scheduling algorithm is decreased as compared to that of the traditional method. The impact of parameters on the delay performance is also evaluated.

Cite

CITATION STYLE

APA

Zhang, Y., Du, P., Wang, J., Ba, T., Ding, R., & Xin, N. (2019). Resource Scheduling for Delay Minimization in Multi-Server Cellular Edge Computing Systems. IEEE Access, 7, 86265–86273. https://doi.org/10.1109/ACCESS.2019.2924032

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free