Frontiers of Information Technology & Electronic Engineering
>> 2016,
Volume 17,
Issue 12
doi:
10.1631/FITEE.1500497
Article
Caching resource sharing in radio access networks: a game theoretic approach
. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China.. Beijing Advanced Innovation Center for Future Internet Technology, Beijing University of Technology, Beijing 100124, China.. Department of Systems and Computer Engineering, Carleton University, Ottawa, ON K1S 5B6, Canada
Available online: 2016-12-29
Next
Previous
Abstract
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.
京公网安备 11010502051620号
