.png){kind=icon}
返回
Time-continuous computing offloading algorithm with user fairness guarantee
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2024.103826.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Computing offloading is a potential avenue to reduce transmission delay by moving computing tasks from cloud to edge nodes. Due to the limited computing capacity of edge nodes, performing effective computing offloading strategy is challenging. To simplify the problem, it is often assumed that the timeline is discrete and offloading decisions are only made at the end of each time slot. However, the assumption results in decision waiting time and increases service delay. In this paper, we first formulate a time-continuous computing offloading problem without the assumption of discrete timeline. In order to reduce service delay while guaranteeing user fairness, the optimization objective is constructed as the alpha-fair utility function of average task delay rather than just average task delay. Then, we propose a novel algorithm by adjusting the reward in standard reinforcement learning to solve this problem, and also prove the convergence of our algorithm theoretically. To the best of our knowledge, this paper is the first attempt to study the time-continuous computing offloading problem with fairness. Evaluations show that the proposed algorithm has better performance in terms of service delay and user fairness compared to five baselines.
Keyword:
Mobile edge computing
Service offloading
Deep reinforcement learning
期刊
IF:
8
论文数:
3.7K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
Deep Reinforcement Learning for Online Computation Offloading in Wireless Powered Mobile-Edge Computing Networks用于无线供电的移动边缘计算网络中在线计算卸载的深度强化学习
OAAI
OAAI分享收藏Energy Efficient Dynamic Offloading in Mobile Edge Computing for Internet of Things面向物联网的移动边缘计算中的高能效动态卸载
PREAI
分享收藏分享收藏
查看更多内容