论文标题
优化切片中的资源分配和VNF嵌入
Optimizing Resource Allocation and VNF Embedding in RAN Slicing
论文作者
论文摘要
5G无线电访问网络（RAN）具有网络切片方法，在下一代网络系统的开发中起关键作用。跑步切片的重点是将基板的资源分为一组独立的可编程跑步式切片。通过网络函数虚拟化（NFV）利用，RAN SLICE由各种虚拟网络函数（VNF）和虚拟链接构成，这些链接嵌入为基板节点上的实例。在这项工作中，我们专注于以下基本任务：i）建立理论基础，用于构建SLICE恢复优化的VNF映射计划，ii）开发有效映射VNF所需的算法。特别是，我们提出了四种有效的算法，包括基于资源的算法（RBA），基于连接性的算法（CBA），基于组的基于组的算法（GBA）和基于组连接的算法（GCBA），以解决资源分配和VNF映射问题。还进行了广泛的实验，以通过所提出的算法验证切片的鲁棒性。
5G radio access network (RAN) with network slicing methodology plays a key role in the development of the next-generation network system. RAN slicing focuses on splitting the substrate's resources into a set of self-contained programmable RAN slices. Leveraged by network function virtualization (NFV), a RAN slice is constituted by various virtual network functions (VNFs) and virtual links that are embedded as instances on substrate nodes. In this work, we focus on the following fundamental tasks: i) establishing the theoretical foundation for constructing a VNF mapping plan for RAN slice recovery optimization and ii) developing algorithms needed to map/embed VNFs efficiently. In particular, we propose four efficient algorithms, including Resource-based Algorithm (RBA), Connectivity-based Algorithm (CBA), Group-based Algorithm (GBA), and Group-Connectivity-based Algorithm (GCBA) to solve the resource allocation and VNF mapping problem. Extensive experiments are also conducted to validate the robustness of RAN slicing via the proposed algorithms.
