论文标题
计算在异质车辆边缘网络中的卸载:在线和销售盗销解决方案
Computation Offloading in Heterogeneous Vehicular Edge Networks: On-line and Off-policy Bandit Solutions
论文作者
论文摘要
随着智能运输系统(ITS)和车辆通信的快速发展,车辆边缘计算(VEC)正在成为一种有前途的技术,以支持低延迟的应用和服务。在本文中,我们考虑了在异质VEC方案中移动车辆/用户的计算卸载问题,并专注于网络和基站选择问题,而不同的网络有不同的流量负载。在快速变化的车辆环境中,由于与基站共同划分的边缘计算服务器的交通拥堵,用户的计算卸载经验受到了潜伏期的强烈影响。但是,由于这种环境的非平稳属性以及信息短缺,预测这种拥塞是一项涉及的任务。为了应对这一挑战,我们提出了一种基于多军匪徒理论的在线学习算法和一个非政策学习算法。为了在零件固定环境中动态选择最不受欢迎的网络,这些算法预测了使用卸载历史记录的卸载任务经历的延迟。此外,为了最大程度地减少由于车辆的活动性而导致的任务损失,我们开发了一种选择基站选择的方法。此外,我们为所选网络提出了一种继电器机制,该机制是根据车辆的周时间运行的。通过密集的数值分析,我们证明了提出的基于学习的解决方案通过选择最不受欢迎的网络来适应网络的流量变化,从而减少了卸载任务的延迟。此外,我们证明了拟议的联合基站选择以及中继机制最大程度地减少了车辆环境中的任务损失。
With the rapid advancement of Intelligent Transportation Systems (ITS) and vehicular communications, Vehicular Edge Computing (VEC) is emerging as a promising technology to support low-latency ITS applications and services. In this paper, we consider the computation offloading problem from mobile vehicles/users in a heterogeneous VEC scenario, and focus on the network- and base station selection problems, where different networks have different traffic loads. In a fast-varying vehicular environment, computation offloading experience of users is strongly affected by the latency due to the congestion at the edge computing servers co-located with the base stations. However, as a result of the non-stationary property of such an environment and also information shortage, predicting this congestion is an involved task. To address this challenge, we propose an on-line learning algorithm and an off-policy learning algorithm based on multi-armed bandit theory. To dynamically select the least congested network in a piece-wise stationary environment, these algorithms predict the latency that the offloaded tasks experience using the offloading history. In addition, to minimize the task loss due to the mobility of the vehicles, we develop a method for base station selection. Moreover, we propose a relaying mechanism for the selected network, which operates based on the sojourn time of the vehicles. Through intensive numerical analysis, we demonstrate that the proposed learning-based solutions adapt to the traffic changes of the network by selecting the least congested network, thereby reducing the latency of offloaded tasks. Moreover, we demonstrate that the proposed joint base station selection and the relaying mechanism minimize the task loss in a vehicular environment.