PSACCF: Prioritized Online Slice Admission Control Considering Fairness in 5G/B5G Networks

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 of each admitted request. Except for resource restrictions, more factors need to be considered in the sliced environment during the admission process, such as priority and fairness. The former relates to the innate characteristics of different services, while the latter matters because slices are instantiated on the shared physical equipments. In this paper, we investigate the SAC problem in 5G/B5G networks, taking priority and fairness into account simultaneously. Reinterpretation of the two intuitively conflicting concepts are proposed in advance to cope with this special scenario, then an online SAC algorithm called Prioritized Slice Admission Control Considering Fairness, PSACCF in short, is designed to help maintaining priority and achieving an adjustable degree of fairness under the assumption of rational service subscribers. Numerous simulations are carried out and the results show that PSACCF can effectively enhance the fairness indicator without compromising the priority requirement, and exhibits stronger stability and adaptability over existing policies.