Multi-access Edge Computing (MEC) is an emerging computing paradigm that extends cloud computing to the network edge (e.g., base stations, MEC servers) to support resource-intensive applications on mobile devices. As a crucial problem in MEC, service migration needs to decide where to migrate user services for maintaining high Quality-of-Service (QoS), when users roam between MEC servers with limited coverage and capacity. However, finding an optimal migration policy is intractable due to the highly dynamic MEC environment and user mobility. Many existing works make centralized migration decisions based on complete system-level information, which can be time-consuming and suffer from the scalability issue with the rapidly increasing number of mobile users. To address these challenges, we propose a new learning-driven method, namely Deep Recurrent Actor-Critic based service Migration (DRACM), which is user-centric and can make effective online migration decisions given incomplete system-level information. Specifically, the service migration problem is modeled as a Partially Observable Markov Decision Process (POMDP). To solve the POMDP, we design an encoder network that combines a Long Short-Term Memory (LSTM) and an embedding matrix for effective extraction of hidden information. We then propose a tailored off-policy actor-critic algorithm with a clipped surrogate objective for efficient training. Results from extensive experiments based on real-world mobility traces demonstrate that our method consistently outperforms both the heuristic and state-of-the-art learning-driven algorithms, and achieves near-optimal results on various MEC scenarios.
翻译:多获取率电子计算(MEC)是一个新兴的计算模式,它将云计算扩展至网络边缘(例如基站、MEC服务器),以支持移动设备的资源密集型应用。作为MEC的一个关键问题,服务性迁移需要决定如何迁移用户服务,以维持高服务质量(QOS),因为用户在MEC服务器之间漫游,其覆盖面和容量都有限。然而,由于系统级信息不全,找到最佳移徙政策是难以解决的。许多现有工作根据完整的系统级信息(例如基站、MEC服务器)做出集中移徙决定,这可能会耗时,而且会因移动设备数量迅速增加的移动用户的可缩放问题而受到影响。为了应对这些挑战,我们提出了一个新的学习驱动方法,即基于服务深度和容量有限的深度服务(DRACM),它以用户为中心,能够做出有效的在线移徙决定。具体来说,服务性迁移问题模拟为局部可观测的Markov决定程序(POMDP) 。为了解决POMDP,我们设计了一个基于快速成本的可缩缩算,我们设计了一个以隐藏的缩缩缩缩缩缩缩缩图网络,将一个基于长期的缩缩缩略图的缩缩缩图,我们提出一个基于的缩缩略图的缩图的缩图的缩图的缩图的缩图。