Research On Resource Allocation Algorithm Of Multi-tenant Heterogeneous Wireless Access Network

As network size and service demand grow,the slicing resource allocation problem becomes more complex,requiring more efficient and fine-grained resource scheduling and allocation strategies.The objective of this paper is to explore the problem of resource allocation for radio access network slicing in a multi-tenant heterogeneous network consisting of multiple types of base stations and tenants with varying service types and tenant requirements.A more accurate rate calculation formula is proposed in order to meet the demand for low latency and high reliability for users using small packets for transmission.In addition,the impact of channel fluctuations and user mobility on system performance is considered to better suit the practical application scenarios.Firstly,the admission control and congestion control mechanisms are proposed to judge the admission of new and admitted users.By dynamically adjusting the admission threshold,a trade-off can be made between user performance and system benefits.In terms of congestion control,two strategies based on priority and number of users are proposed,which can be selected according to specific needs to achieve the best control effect.The approximate Jacobi alternating multiplier method is used for the solution,which can be better applied to parallel computing,thus improving the computational efficiency of the algorithm.Secondly,a wireless resource allocation algorithm based on Lyapunov optimisation is proposed.The algorithm sets up differentiated isolation metrics and quality of service requirements for different types of tenants by considering incomplete channel state information in the actual environment,in order to achieve efficient resource allocation and ensure isolation between users.Then,Liapunov optimisation techniques are used to cope with the randomness of the wireless channel and the unknown incoming traffic over time.Finally,fairness in the resource allocation process is particularly important to consider for multi-tenant heterogeneous networks.To provide fairness in the scheduling scheme,fairness in resource allocation between different base stations is ensured,as well as fairness between users within the same base station,and the weighted proportional fairness algorithm in this paper can dynamically adjust the weights according to the number of base station users.The minimum and maximum rates are used in the user constraint,which provides a congestion control mechanism while ensuring user demand.A low-complexity distributed algorithm,Lagrangian pairwise decomposition,is used for optimisation,thus effectively reducing computational complexity reducing convergence time and being suitable for large-scale distributed scenarios.