Towards Efficiently Provisioning 5G Core Network Slice Based on Resource and Topology Attributes
Towards Efficiently Provisioning 5G Core Network Slice Based on Resource and Topology Attributes
复制标题
DOI：
10.3390/app9204361
复制
发表时间：
2019-10
期刊：
影响因子：
--
通讯作者：
Xin Li;Chengcheng Guo;Jun Xu;Lav Gupta;R. Jain
中科院分区：
文献类型：
--
作者：
Xin Li;Chengcheng Guo;Jun Xu;Lav Gupta;R. Jain
5G网络切片的高效配置是5G网络切片技术面临的一大挑战。以前的切片供应方法只考虑了网络资源属性，而忽略了网络拓扑属性。这些方法可能导致切片接受率和切片供应收入的降低。针对这些问题，本文通过综合考虑网络资源属性和拓扑属性，提出了一种适用于5G核心网的两阶段启发式分片分配算法RT-CSP。该方法的第一阶段称为切片节点配置阶段，在该阶段中，我们提出了一种使用网络资源属性(即CPU容量和带宽)和拓扑属性(即度中心度和贴近度中心度)来对节点进行评分和排序的方法。然后，根据节点排名结果来提供切片节点。在第二阶段，称为切片链路提供阶段，使用k-最短路径算法来提供切片链路。为了进一步提高RT-CSP的性能，我们提出了RT-CSP+，它使用我们设计的minMaxBWUtilHops策略来选择最好的物理路径来承载切片链路。该策略将候选物理路径的最大链路带宽利用率与其上的跳数的乘积最小化，以避免在物理路径上造成瓶颈，降低带宽成本。通过大量的模拟，我们将我们的结果与最先进的算法的结果进行了比较。实验结果表明，该算法提高了切片接受率，提高了资源调配的收益成本比。
Efficient provisioning of 5G network slices is a major challenge for 5G network slicing technology. Previous slice provisioning methods have only considered network resource attributes and ignored network topology attributes. These methods may result in a decrease in the slice acceptance ratio and the slice provisioning revenue. To address these issues, we propose a two-stage heuristic slice provisioning algorithm, called RT-CSP, for the 5G core network by jointly considering network resource attributes and topology attributes in this paper. The first stage of our method is called the slice node provisioning stage, in which we propose an approach to scoring and ranking nodes using network resource attributes (i.e., CPU capacity and bandwidth) and topology attributes (i.e., degree centrality and closeness centrality). Slice nodes are then provisioned according to the node ranking results. In the second stage, called the slice link provisioning stage, the k-shortest path algorithm is implemented to provision slice links. To further improve the performance of RT-CSP, we propose RT-CSP+, which uses our designed strategy, called minMaxBWUtilHops, to select the best physical path to host the slice link. The strategy minimizes the product of the maximum link bandwidth utilization of the candidate physical path and the number of hops in it to avoid creating bottlenecks in the physical path and reduce the bandwidth cost. Using extensive simulations, we compared our results with those of the state-of-the-art algorithms. The experimental results show that our algorithms increase slice acceptance ratio and improve the provisioning revenue-to-cost ratio.