PSACCF：5G/ B5G网络中考虑公平性的优先级在线切片接纳控制
PSACCF: Prioritized Online Slice Admission Control Considering Fairness in 5G/B5G Networks
摘要：
5G/B5 G被设想为在网络切片的帮助下支持各种服务，每个切片实例要求足够的资源来向其订户提供预先协商的服务质量。切片接纳控制（SAC）算法是切片提供者（SP）在有限资源的情况下保证每个被接纳请求的QoS和QoE的必要条件。在这种情况下，服务的优先关注和资源分配的公平性成为研究者有意义的话题。前者源于5G网络支持的各种服务的固有特性，后者很重要，因为切片是在共享物理设备上实例化的。然而，这两个问题在文献中主要是单独研究或没有得到足够的研究同时。在这项工作中，我们研究了5G/B5 G网络中的SAC问题，旨在满足必要的优先级要求的前提下提高公平度。我们首先将优先级重新解释为较高的累积服务接受率（CSAR），并采用相邻CSAR间隙的均匀性来反映公平性。基于这些调整，SAC问题被制定为一个非线性和非凸多目标优化。为此，本文提出了一种启发式算法PSACCF（Prioritized Slice Admission Control Considering Fairness），该算法引入服务的资源效率来修正优先级违规，通过为每种服务设置目标CSAR并将其实际CSAR推向目标CSAR来提高公平性。大量的模拟进行了比较PSACCF与现有的两种算法，称为MHPF和AHPF的性能。结果表明，我们的算法可以实现一个几乎相同的优先级指标的比较，以及至少33.6%的公平度和更高的最低平均资源利用率的改善。
英文摘要：
5G/B5G is envisioned to support various services with the assistance of network slices, each slice instance asks for adequate resources to provide the pre-negotiated service quality to its subscribers. Slice Admission Control (SAC) algorithm is a necessity for Slice Providers (SPs) to guarantee the QoS and QoE of each admitted request with limited resources. In that circumstance, the priority concern of services and the fairness of resource allocation arise as meaningful topics for researchers. The former originates from the innate characteristics of various services supported by 5G networks, and the latter matters because slices are instantiated on shared physical equipment. However, the two issues are mainly investigated separately in the literature or do not receive sufficient research simultaneously. In this work, we study the SAC problem in 5G/B5G networks, aiming at enhancing the fairness degree on the premise of satisfying the necessary priority requirements. We first reinterpret priority as a higher cumulative service acceptance ratio (CSAR), and adopt the uniformity of adjacent CSAR gaps to reflect the fairness. Based on these adjustments, the SAC problem is formulated as a non-linear and non-convex multi-objective optimization. Thus, we propose a heuristic algorithm called Prioritized Slice Admission Control Considering Fairness (PSACCF) to solve it. It introduces the resource efficiency of services to amend priority violations, then promotes fairness by setting the target CSARs for each service type and pushing their actual CSARs toward. Numerous simulations are carried out to compare the performance of PSACCF with two existing algorithms, termed MHPF and AHPF. Results show that our algorithm can achieve a nearly identical priority indicator to the comparisons, as well as at least a 33.6% improvement in fairness degree and a higher minimum average resource utilization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
