| Information-Centric Networking(ICN)has become the trend of network development in the future,supporting ubiquitous caching features.As the key technology of the new generation network,network slicing can realize the architecture based on the ICN service.However,there are still many problems in the use and deployment of caching resources in the ICN slice,such as the waste of cache resources and the no-load overhead of cache nodes,and so on.Therefore,this paper deeply studies the ICN slice and further optimizes the caching resource allocation and dynamic deployment scheme of the ICN slice by using the method of the game theory.To make full use of caching resources in static environment,this thesis proposes hierarchical caching resource allocation strategy based on the Stackelberg game within the ICN slice.Firstly,the hierarchical caching resource allocation architecture within the ICN slice is described as ICN communication service provider(ICSP)and content providers(CPs)in this paper and constructs the ICSP and CPs as a Stackelberg game model with one leader and multiple followers.Secondly,the caching resource allocation in the ICSP is modeled as a mixed-integer programming problem combining caching cost and transmission energy consumption,and the optimized caching resource allocation scheme is obtained by using the improved elite genetic algorithm(IEGA).Finally,the optimal pricing of the ICSP and the optimal placement number of CPs are obtained by the iteration of game algorithm(ITOG).The simulation results show that the algorithm has higher effectiveness and better caching resource allocation ability,and can effectively reduce the transmission energy consumption and caching cost.To meet the needs of mobile users and networks in the hierarchical network,this thesis proposes a dynamic caching resource deployment strategy for ICN slice based on the coalitional game.Firstly,in order to improve the network revenue,this paper models the interaction between cache nodes at the current time as the coalitional game.The coalitional game can focus on sloving macro problems,which is difficult to deal with micro problems such as whether cache nodes are deployed,the mobility of the users,and the time for deployment.Then,to make up for the lack of micro dimension of the coalitional game,this thesis constructs the dynamic deployment of cache nodes as an integer linear programming problem to maximize collective income.The problem consists of three parts: whether to deploy multiple access edge computing(MEC)nodes,whether the user request is allocated,and whether to reassign MEC nodes for mobile users.Ultimately,to reduce the cost and solve the problem of deployment time in the game,this paper proposes an optimal stop algorithm in the time domain.The algorithm determines the optimal redeployment time of the MEC nodes according to the latency violation value and service latency requirements.Simulation results show that the proposed solution can effectively reduce the latency of user requests and improve the benefits of the ICSP. |
