多主多从Stackelberg博弈下的边缘缓存资源分配算法

为鼓励视频服务提供商参与到缓存过程中，本文提出一种基于Stackelberg博弈的激励缓存资源分配算法。与传统激励缓存资源分配方案不同，本文考虑同时存在多个网络运营商和多个视频服务提供商，视频服务提供商从网络运营商处购买存储空间以缓存热门视频。针对该场景，本文将该激励缓存模型建模为多主多从Stackelberg博弈问题，分别构建主方和从方的效用函数，证明了在网络运营商价格确定的情况下，视频服务提供商之间的非合作博弈存在纳什均衡。文章利用分布式迭代算法对该博弈模型进行求解，获得了视频服务提供商的最优缓存策略和网络运营商的最优价格策略。仿真结果表明，本文提出的激励缓存机制可使视频服务提供商获得比其他缓存分配算法更高的单位成本收益。 

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.