Edge Cache Resource Allocation Algorithm Based on Stackelberg Game

In order to encourage video service providers to participate in the caching process, this paper proposes an incentive cache resource allocation algorithm based on Stackelberg game. Different from traditional incentive cache resource allocation scheme, this paper considers that there are multiple network operators and multiple video service providers at the same time. The video service providers purchase storage space from the network operator to cache popular videos. For this scenario, this paper models the incentive cache model as a multi-master and multi-slave Stackelberg game problem, and constructs the utility functions of the master and slave respectively, which proves that in the case of the given network operator’s price, there is a Nash equilibrium in video service providers’ non-cooperative game. The article uses the distributed iterative algorithm to solve the game model, and obtains the optimal cache strategy of the video service provider and the optimal price strategy of the network operator. The simulation results show that the incentive caching mechanism proposed in this paper can make the video service provider obtain higher unit cost benefit than other cache allocation algorithms.