Network slicing endows 5G/B5G with differentiated and customized capabilities to cope with the proliferation of diversified services, whereas limited physical network resources may not be able to support all service requests. Slice admission control is regarded as an essential means to ensure service quality and service isolation when the network is under burden. Herein, the scenario where rational tenants coexist with partially competitive network slice providers is adopted. We aim to maximize the long-term average revenue of the network operators through slice admission control, with the feasibility of multidimensional resource requirements, the priority differences among heterogeneous slices, and the admission fairness within each slice taken into account concurrently. We prove the intractability of our problem by a reduction from the Multidimensional Knapsack Problem (MKP), and propose a two-stage algorithm called MPSAC to make a sub-optimal solution efficiently. The principle of MPSAC is to split the original problem into two sub-problems; inter-slice decision-making and intra-slice quota allocation, which are solved using a heuristic method and a tailored auction mechanism respectively. Extensive simulations are carried out to demonstrate the efficacy of our algorithm, the results show that the long-term average revenue of ours is at least 9.6% higher than comparisons while maintaining better priority relations and achieving improved fairness performance.

翻译：网络切片赋予5G/B5G差异化与定制化能力以应对多样化服务的激增，但有限的物理网络资源可能无法支撑所有服务请求。切片接纳控制被视为网络过载时保障服务质量和隔离性的关键手段。本文采用理性租户与部分竞争型网络切片提供商共存的场景，目标是通过切片接纳控制最大化网络运营商的长期平均收益，同时兼顾多维资源需求的可行性、异构切片间的优先级差异以及每个切片内部的接纳公平性。通过将多维背包问题归约至本问题，我们证明了其计算复杂性，并提出一种名为MPSAC的两阶段算法以高效获取次优解。MPSAC的核心思想是将原问题分解为切片间决策与切片内配额分配两个子问题，分别采用启发式方法和定制化拍卖机制求解。大量仿真验证了算法有效性，结果表明，相较于对比方案，本算法在长期平均收益上至少提升9.6%，同时保持了更优的优先级关系并实现了更高的公平性。