Caching resource sharing in radio access networks： a game theoretic approach

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 f...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers of information technology & electronic engineering 2016-12, Vol.17 (12), p.1253-1265
Main Authors: Xie, Jun-feng, Xie, Ren-chao, Huang, Tao, Liu, Jiang, Yu, F. Richard, Liu, Yun-jie
Format: Article
Language:English
Subjects:
Caching
Cellular communication
Communications Engineering
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Dynamic stability
Dynamics
Electrical Engineering
Electronics and Microelectronics
Game theory
Instrumentation
Mathematical analysis
Networks
Optimization
Radio
Radio equipment
Resource allocation
Stability analysis
Strategy
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2095-9184
2095-9230
DOI:10.1631/FITEE.1500497