Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellu...Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellular networks, most of the previous works have focused on performance optimization for content caching. To the best of our knowledge, the problem of caching resource sharing for multiple service provider servers （SPSs） has been largely ignored. In this paper, by assuming that the caching capability is deployed in the base station of a radio access network, we consider the problem of caching resource sharing for multiple SPSs competing for the caching space. We formulate this problem as an oligopoly market model and use a dynamic non-cooperative game to obtain the optimal amount of caching space needed by the SPSs. In the dynamic game, the SPSs gradually and iteratively adjust their strategies based on their previous strategies and the information given by the base station. Then through rigorous mathematical analysis, the Nash equilibrium and stability condition of the dynamic game are proven. Finally, simulation results are presented to show the performance of the proposed dynamic caching resource allocation scheme.展开更多
基金Project supported by the National Natural Science Foundation of China （No. 61501042）, the National Science and Technology Major Project （No. 2015ZX03003002- 002）, the BUPT Special Program for Youth Scientific Research Innovation （No. 2015RC10）, the Beijing Nova Program （No. Z151100000315078）, and the State Key Laboratory of Net-working and Switching Technology Scientific Research Project, China （No. NST20140104）
文摘Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellular networks, most of the previous works have focused on performance optimization for content caching. To the best of our knowledge, the problem of caching resource sharing for multiple service provider servers （SPSs） has been largely ignored. In this paper, by assuming that the caching capability is deployed in the base station of a radio access network, we consider the problem of caching resource sharing for multiple SPSs competing for the caching space. We formulate this problem as an oligopoly market model and use a dynamic non-cooperative game to obtain the optimal amount of caching space needed by the SPSs. In the dynamic game, the SPSs gradually and iteratively adjust their strategies based on their previous strategies and the information given by the base station. Then through rigorous mathematical analysis, the Nash equilibrium and stability condition of the dynamic game are proven. Finally, simulation results are presented to show the performance of the proposed dynamic caching resource allocation scheme.
