当前位置: X-MOL 学术Wirel. Commun. Mob. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Joint Congestion Control and Resource Allocation for Delay-Aware Tasks in Mobile Edge Computing
Wireless Communications and Mobile Computing ( IF 2.146 ) Pub Date : 2021-01-09 , DOI: 10.1155/2021/8897814
Shichao Li 1, 2 , Qiuyun Wang 2 , Yunfeng Wang 2 , Jianli Xie 3 , Cuiran Li 3 , Dengtai Tan 2 , Weigang Kou 2 , Wenjie Li 4
Affiliation  

Recently, in order to extend the computation capability of smart mobile devices (SMDs) and reduce the task execution delay, mobile edge computing (MEC) has attracted considerable attention. In this paper, a stochastic optimization problem is formulated to maximize the system utility and ensure the queue stability, which subjects to the power, subcarrier, SMDs, and MEC server computation resource constraints by jointly optimizing congestion control and resource allocation. With the help of the Lyapunov optimization method, the primal problem is transformed into five subproblems including the system utility maximization subproblem, SMD congestion control subproblem, SMD computation resource allocation subproblem, joint power and subcarrier allocation subproblem, and MEC server scheduling subproblem. Since the first three subproblems are all single variable problems, the solutions can be obtained directly. The joint power and subcarrier allocation subproblem can be efficiently solved by utilizing alternating and time-sharing methods. For the MEC server scheduling subproblem, an efficient algorithm is proposed to solve it. By solving the five subproblems at each slot, we propose a delay-aware task congestion control and resource allocation (DTCCRA) algorithm to solve the primal problem. Theoretical analysis shows that the proposed DTCCRA algorithm can achieve the system utility and execution delay trade-off. Compared with the intelligent heuristic (IH) algorithm, when the control parameter increases from to , the total backlogs are decreased by 5.03% and the system utility is increased by 3.9% on average for the extensive performance by using the proposed DTCCRA algorithm.

中文翻译:

移动边缘计算中延迟感知任务的联合拥塞控制和资源分配

近来,为了扩展智能移动设备(SMD)的计算能力并减少任务执行延迟,移动边缘计算(MEC)引起了相当大的关注。本文提出了一种随机优化问题,通过联合优化拥塞控制和资源分配来最大化系统效用并确保队列稳定性,该问题受功率,子载波,SMD和MEC服务器计算资源的约束。借助Lyapunov优化方法,将原始问题转换为五个子问题,包括系统实用程序最大化子问题,SMD拥塞控制子问题,SMD计算资源分配子问题,联合功率和子载波分配子问题以及MEC服务器调度子问题。由于前三个子问题都是单变量问题,因此可以直接获得解。通过使用交替和分时方法,可以有效地解决联合功率和子载波分配子问题。针对MEC服务器调度子问题,提出了一种有效的算法来解决。通过解决每个时隙的五个子问题,我们提出了一种延迟感知任务拥塞控制和资源分配(DTCCRA)算法,以解决原始问题。理论分析表明,所提出的DTCCRA算法可以实现系统实用性和执行延迟权衡。与智能启发式(IH)算法相比,当控制参数 通过使用交替和分时方法,可以有效地解决联合功率和子载波分配子问题。针对MEC服务器调度子问题,提出了一种有效的算法来解决。通过解决每个时隙的五个子问题,我们提出了一种延迟感知任务拥塞控制和资源分配(DTCCRA)算法,以解决原始问题。理论分析表明,所提出的DTCCRA算法可以实现系统实用性和执行延迟权衡。与智能启发式(IH)算法相比,当控制参数 通过使用交替和分时方法,可以有效地解决联合功率和子载波分配子问题。针对MEC服务器调度子问题,提出了一种有效的算法来解决。通过解决每个时隙的五个子问题,我们提出了一种延迟感知任务拥塞控制和资源分配(DTCCRA)算法,以解决原始问题。理论分析表明,所提出的DTCCRA算法可以实现系统实用性和执行延迟权衡。与智能启发式(IH)算法相比,当控制参数 我们提出了一种延迟感知任务拥塞控制和资源分配(DTCCRA)算法来解决原始问题。理论分析表明,所提出的DTCCRA算法可以实现系统实用性和执行延迟权衡。与智能启发式(IH)算法相比,当控制参数 我们提出了一种延迟感知任务拥塞控制和资源分配(DTCCRA)算法来解决原始问题。理论分析表明,所提出的DTCCRA算法可以实现系统实用性和执行延迟权衡。与智能启发式(IH)算法相比,当控制参数从增大到总的积压由5.03%降低,系统实用程序是通过使用所提出的算法DTCCRA上升3.9%,平均为广泛的性能。
更新日期:2021-01-10
down
wechat
bug