Cooperative jobs dispatching in edge computing network with unpredictable uploading delay

Lyu，Bo Jie1; Hong，Yun Cong1,2; Tan，Hai Sheng3; Han，Zhen Hua2; Wang，Rui1

2020-03-25

Journal of Communications and Information Networks   影响因子和分区

2096-1081

2509-3312

In this paper, the cooperative jobs dispatching problem in an edge computing network with multiple access points (APs) and edge servers is considered. Due to the uncertain traffic in the network between APs and edge servers, the job uploading delay can not be predicted accurately. Specifically, the job arrivals at the APs, the job uploading delay from APs to edge servers and the job computation time at the edge servers are all modeled as random variables. Since each job dispatching decision will affect the system state in the future, we formulate the joint optimization of jobs dispatching at all the APs and all the scheduling time slots as an infinite-horizon Markov decision process (MDP). The minimization objective is a discounted measurement of the average processing time per job, including the uploading delay, the waiting time and the computation time at the edge servers. In this problem, the approximate MDP should be adopted to address the curse of dimensionality. Conventional low-complexity approximate solution of MDP is usually hard to predict the performance analytically. In this paper, a novel approximate MDP solution framework is proposed via one-step policy iteration over a baseline policy, where the analytical performance bound can be obtained. Moreover, since the expression of the approximate value function is derived, the value iteration in conventional methods can be eliminated, which can essentially reduce the computation complexity. It is shown by simulations that the proposed low-complexity algorithm has significantly better performance than various benchmark schemes.

Approximate MDP Edge computing Jobs dispatching Markov decision process (MDP)

EI

英语

第一 ; 通讯

20215011304337

Benchmarking ; Complex networks ; Computational complexity ; Iterative methods ; Markov processes

Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory:721.1 ; Computer Systems and Equipment:722 ; Digital Computers and Systems:722.4 ; Numerical Methods:921.6 ; Probability Theory:922.1

2-s2.0-85095018939

Scopus

1.Department of Electrical and Electronic Engineering,Southern University of Science and Technology (SUSTech),Shenzhen,518055,China
2.Department of Computer Science,The University of Hong Kong (HKU),999077,Hong Kong
3.LINKE Lab,University of Science and Technology of China (USTC),Hefei,230026,China

Lyu，Bo Jie,Hong，Yun Cong,Tan，Hai Sheng,et al. Cooperative jobs dispatching in edge computing network with unpredictable uploading delay[J]. Journal of Communications and Information Networks,2020,5(1):75-85.

Lyu，Bo Jie,Hong，Yun Cong,Tan，Hai Sheng,Han，Zhen Hua,&Wang，Rui.(2020).Cooperative jobs dispatching in edge computing network with unpredictable uploading delay.Journal of Communications and Information Networks,5(1),75-85.

Lyu，Bo Jie,et al."Cooperative jobs dispatching in edge computing network with unpredictable uploading delay".Journal of Communications and Information Networks 5.1(2020):75-85.