Edge-Cloud Offloading: Knapsack Potential Game in 5G Multi-Access Edge Computing

Cheng Ying Hsieh, Yi Ren, Jyh Cheng Chen*

*此作品的通信作者

研究成果: Article同行評審

13 引文 斯高帕斯(Scopus)

摘要

In 5G, multi-access edge computing enables the applications to be offloaded to near-end edge servers for faster response. According to the 3GPP standards, users in 5G are separated into many types, e.g., vehicles, AR/VR, IoT devices, etc. Specifically, the high-priority traffic can preempt edge resources to guarantee the service quality. However, even if a traffic is transmitted with low priority, its latency requirement in 5G is much lower than that in 4G. Too strict latency requirement and priority-based service make resource configuration difficult on the edge side. Therefore, we propose the edge-cloud offloading mechanism, in which each edge server can offload tasks to back-end cloud server to ensure service quality of both high- and low-priority traffic. In this paper, we establish a priority-based queuing system to model the edge-cloud offloading behaviors. Based on the formulation of our system model, we propose Knapsack Potential Game (KPG) to derive an optimal offloading ratio for each edge server to balance the cost-effectiveness of the overall system. We demonstrate that KPG has low computational complexity and outperforms two baseline algorithms. The results indicate that KPG's performance is optimal and provides a theoretical guideline to operators while designing their edge-cloud offloading strategies without large-scale implementation.

原文English
頁(從 - 到)7158-7171
頁數14
期刊IEEE Transactions on Wireless Communications
22
發行號11
DOIs
出版狀態Published - 1 11月 2023

指紋

深入研究「Edge-Cloud Offloading: Knapsack Potential Game in 5G Multi-Access Edge Computing」主題。共同形成了獨特的指紋。

引用此