As mobile networks proliferate, we are experiencing a strong diversification of services, which requires greater flexibility from the existing network. Network slicing is proposed as a promising solution for resource utilization in 5G and future networks to address this dire need. In network slicing, dynamic resource orchestration and network slice management are crucial for maximizing resource utilization. Unfortunately, this process is too complex for traditional approaches to be effective due to a lack of accurate models and dynamic hidden structures. We formulate the problem as a Constrained Markov Decision Process (CMDP) without knowing models and hidden structures. Additionally, we propose to solve the problem using CLARA, a Constrained reinforcement LeArning based Resource Allocation algorithm. In particular, we analyze cumulative and instantaneous constraints using adaptive interior-point policy optimization and projection layer, respectively. Evaluations show that CLARA clearly outperforms baselines in resource allocation with service demand guarantees.
翻译:随着移动网络的激增,我们正经历着一种强大的服务多样化,这要求现有网络有更大的灵活性。网络切片是5G和未来网络资源利用的一个大有希望的解决方案,以解决这一迫切需要。在网络切片、动态资源调控和网络切片管理方面,对资源利用最大化至关重要。不幸的是,由于缺乏准确的模型和动态的隐藏结构,这一流程过于复杂,传统方法无法发挥效力。我们把这一问题描述成一个没有了解模型和隐藏结构的受约束的马尔科夫决策过程。此外,我们提议使用CLARA(一个受约束的强化勒阿宁资源配置算法)来解决这一问题。特别是,我们分别利用适应性的内点政策优化和投影层来分析累积和瞬间制约。评估显示,CARA明显超越了有服务需求保障的资源分配基线。