期刊
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
卷 140, 期 -, 页码 -出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2023.103492
关键词
Average response time; Computation offloading; Markov chain; Mobility; Performance prediction; Queueing system; Random walk
In this paper, we propose a computation offloading strategy to satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. By using Markov chains to characterize UE mobility and calculating the joint probability distribution of UE locations, we can obtain the average response time of UEs and predict the overall average response time of tasks. Additionally, we solve the power constrained MEC speed setting problem.
We treat user equipments (UEs) and mobile edge clouds (MECs) as M/G/1 queueing systems, which are the most suitable, powerful, and manageable models. We propose a computation offloading strategy which can satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. We use discrete-time Markov chains, continuoustime Markov chains, and semi-Markov processes to characterize the mobility of UEs, and calculate the joint probability distribution of the locations of UEs at any time. We extend our Markov chains to incorporate mobility cost into consideration, and are able to obtain the average response time of a UE with location change penalty. We can algorithmically predict the overall average response time of tasks generated on a UE and also demonstrate numerical data and examples. We consider the power constrained MEC speed setting problem and develop an algorithm to solve the problem for two power consumption models. (c) 2023 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据