arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.05239cs.NIcs.AIcs.DCcs.MMcs.SE
收藏

Follow Me at the Edge:面向移动边缘计算的移动感知动态服务部署

Follow Me at the Edge: Mobility-Aware Dynamic Service Placement for Mobile Edge Computing

School of Data and Computer Science, Sun Yat-sen University(中山大学数据科学与计算机学院)

Tao Ouyang, Zhi Zhou, Xu Chen

摘要:

移动边缘计算是一种新的计算范式,它将云计算能力从集中式云推向网络边缘。然而,随着计算能力的下沉,用户移动性带来的新挑战出现了:由于最终用户通常不规则地移动,因此服务应该在多个边缘之间动态迁移以保持服务性能,即,用户感知的延迟。解决这个问题并不容易,因为频繁的服务迁移会大大增加运营成本。为了解决这一挑战的性能-成本权衡,在本文中,我们研究了长期成本预算约束下的移动边缘服务性能优化问题。为了解决用户移动性通常是不可预测的,我们应用李亚普诺夫优化分解成一系列的实时优化问题,不需要先验知识,如用户的移动性的长期优化问题。由于分解问题是NP难的,我们首先设计了一个基于Markov逼近的近似算法来寻求近优解。为了使我们的解决方案具有可扩展性并适用于未来具有大规模用户设备的5G应用场景,我们进一步提出了一种基于最佳响应更新技术的分布式近似方案,该方案具有大大降低的时间复杂度。严格的理论分析和广泛的评估表明,所提出的集中式和分布式方案的有效性。

英文摘要:

Mobile edge computing is a new computing paradigm, which pushes cloud computing capabilities away from the centralized cloud to the network edge. However, with the sinking of computing capabilities, the new challenge incurred by user mobility arises: since end-users typically move erratically, the services should be dynamically migrated among multiple edges to maintain the service performance, i.e., user-perceived latency. Tackling this problem is non-trivial since frequent service migration would greatly increase the operational cost. To address this challenge in terms of the performance-cost trade-off, in this paper we study the mobile edge service performance optimization problem under long-term cost budget constraint. To address user mobility which is typically unpredictable, we apply Lyapunov optimization to decompose the long-term optimization problem into a series of real-time optimization problems which do not require a priori knowledge such as user mobility. As the decomposed problem is NP-hard, we first design an approximation algorithm based on Markov approximation to seek a near-optimal solution. To make our solution scalable and amenable to future 5G application scenario with large-scale user devices, we further propose a distributed approximation scheme with greatly reduced time complexity, based on the technique of best response update. Rigorous theoretical analysis and extensive evaluations demonstrate the efficacy of the proposed centralized and distributed schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑