Resource Joint Optimization Of Network Slice Economic Model Based On Matching Game

With the rapid development of wireless communication technology,network technology and artificial intelligence technology,new vertical applications have developed rapidly.These new applications show a remarkable feature that the emphasis on communication is different.Therefore,people have higher demand for a flexible,programmable and easy to expand communication architecture.The network slicing technology replaces the special hardware equipment with the virtualization hardware system.The software defines the network,which makes the network more programmable and extensible,and can better meet the diverse needs of different applications.Through the implementation of resource allocation to network slicing,the utilization rate of network resources can be improved,the service quality of users and the economic benefits of operators can be improved.Therefore,resource allocation is particularly important in the study of network slicing.Firstly,the theory of network slicing is introduced.This paper first introduces three important enabling technologies of network slicing,then introduces the basic concept and three-layer structure model of network slicing,then focuses on the concept of wireless access network sub slicing and resource scheduling problem,and finally introduces the theoretical basis of this modeling,namely the economic model of network slicing.In the second chapter,the problem of computing resource allocation is also studied.The problem is modeled as a linear programming problem.The goal is to minimize the user transmission delay and the processing cost of the edge server.This problem can be solved by using mature convex optimization technology,but the computational complexity is high.Simulation results show that the greedy algorithm can achieve a good tradeoff between performance and complexity.Then,the economic models of single and multiple infrastructure suppliers are analyzed and modeled,and the matching game is used to solve the problem.In the process of solving,the utility function is calculated for both sides of the game,the preference list is set,and then the game is carried out according to the basic principle of matching.In the scenario of multi infrastructure suppliers,a hierarchical matching game model is established.The upper and lower levels are one to many matching games.Due to the interaction between the upper and lower levels of game,the convergence of the algorithm is difficult.This paper solves this problem according to the concept of group stability.The simulation results show that the system capacity of the matching game algorithm is better than that of the random allocation algorithm,and when the system resource is greater than the user demand,with the resource continues to increase and the user demand decreases,the saturation phenomenon will appear.In addition,if the number of users continues to increase,the service capacity of virtual resource block will decline,and the system will be saturated.In a word,the game theory method can effectively solve the basic network slice resource allocation problem in a low complexity and distributed way.