Paper Info
Title
A Game Theoretical Framework For Improving The Quality Of Service In Cooperative Ran Caching
Abstract
In this paper, we design a game theoretical framework for improving the Quality of Service (QoS) in cooperative RAN caching. Considering the cooperation under both single cell transmission and joint transmission, the QoS metric is uniformly quantified as the total content delivery time. Although the formulated cooperative content placement problem is proved NP-hard, noticing the local cooperative characteristics, we transform the problem into Local Altruistic Gaming where the Nash Equilibrium (NE) can be guaranteed and distributive algorithms such as Spatial Adaptive Play (SAP) are applicable. Then, two distributed learning algorithms are proposed, where the former overcomes the execution difficulties over tremendous action set in traditional SAP, and the latter further accelerate the convergence by reducing the number of additional suboptimal NEs brought by the former. To further improve the computation efficiency, an updating scheme is constructed to enable parallel updating in the proposed algorithms. Finally, based on a real-world LTE traffic dataset, the performance of the proposed algorithms and the updating scheme have been validated.
Year
Venue
Field
2017
2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)
Convergence (routing),Distributive property,Content delivery,Computer science,Server,Quality of service,Computer network,Real-time computing,Ran,Nash equilibrium,Computation,Distributed computing
DocType
ISSN
Citations 
Conference
1550-3607
0
PageRank 
References 
Authors
0.34
11
4
Name
Order
Citations
PageRank
Chang Yang1163.81
Hongjia Li2214.26
Liming Wang3138.75
Zhen Xu42117.33