arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.03358cs.NIcs.AI

Cost-Effective Two-Stage Network Slicing for Edge-Cloud Orchestrated Vehicular Networks

Peng Cheng Laboratory(鹏城实验室);University of Waterloo(滑铁卢大学);Huazhong University of Science and Technology(华中科技大学);University of Windsor(温莎大学)

Wen Wu, Kaige Qu, Peng Yang, Ning Zhang, Xuemin, Shen, Weihua Zhuang

英文摘要:

In this paper, we study a network slicing problem for edge-cloud orchestrated vehicular networks, in which the edge and cloud servers are orchestrated to process computation tasks for reducing network slicing cost while satisfying the quality of service requirements. We propose a two-stage network slicing framework, which consists of 1) network planning stage in a large timescale to perform slice deployment, edge resource provisioning, and cloud resource provisioning, and 2) network operation stage in a small timescale to perform resource allocation and task dispatching. Particularly, we formulate the network slicing problem as a two-timescale stochastic optimization problem to minimize the network slicing cost. Since the problem is NP-hard due to coupled network planning and network operation stages, we develop a Two timescAle netWork Slicing (TAWS) algorithm by collaboratively integrating reinforcement learning (RL) and optimization methods, which can jointly make network planning and operation decisions. Specifically, by leveraging the timescale separation property of decisions, we decouple the problem into a large-timescale network planning subproblem and a small-timescale network operation subproblem. The former is solved by an RL method, and the latter is solved by an optimization method. Simulation results based on real-world vehicle traffic traces show that the TAWS can effectively reduce the network slicing cost as compared to the benchmark scheme.

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

↑