TY - GEN
T1 - A Stackelberg Game Approach to Large-Scale Edge Caching
AU - Zheng, Zijie
AU - Song, Lingyang
AU - Han, Zhu
AU - Li, Geoffrey Ye
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018
Y1 - 2018
N2 - Caching popular files in the storage of edge networks, namely edge caching, is a promising approach for service providers (SPs) to reduce redundant backhaul transmission to edge nodes (ENs). In this paper, an edge network with one SP, a large number of ENs, and mobile users with time-dependent requests is considered. A convergent and scalable Stackelberg game for edge caching is designed. Specifically, the game is decomposed into two types of sub-games, a storage allocation game (SAG) and a number of user allocation games (UAGs). A Stackelberg game-based alternating direction method of multipliers (Stackelberg game-based ADMM) is proposed to solve either the SAG or each UAG in a distributed manner. The convergence speed and the optimum of the entire game are linearly (or sublinearly) related to the network size, which indicates that this framework can potentially cope with large-scale caching problems. It is also seen in the simulation results that this framework requires fewer backhaul resources than existing approaches.
AB - Caching popular files in the storage of edge networks, namely edge caching, is a promising approach for service providers (SPs) to reduce redundant backhaul transmission to edge nodes (ENs). In this paper, an edge network with one SP, a large number of ENs, and mobile users with time-dependent requests is considered. A convergent and scalable Stackelberg game for edge caching is designed. Specifically, the game is decomposed into two types of sub-games, a storage allocation game (SAG) and a number of user allocation games (UAGs). A Stackelberg game-based alternating direction method of multipliers (Stackelberg game-based ADMM) is proposed to solve either the SAG or each UAG in a distributed manner. The convergence speed and the optimum of the entire game are linearly (or sublinearly) related to the network size, which indicates that this framework can potentially cope with large-scale caching problems. It is also seen in the simulation results that this framework requires fewer backhaul resources than existing approaches.
UR - http://www.scopus.com/inward/record.url?scp=85063496546&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063496546&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2018.8648011
DO - 10.1109/GLOCOM.2018.8648011
M3 - Conference contribution
AN - SCOPUS:85063496546
T3 - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
BT - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Global Communications Conference, GLOBECOM 2018
Y2 - 9 December 2018 through 13 December 2018
ER -