Recommendation-Driven Multi-Cell Cooperative Caching: A Multi-Agent Reinforcement Learning Approach

被引:11
作者
Zhou, Xiaobo [1 ]
Ke, Zhihui [1 ]
Qiu, Tie [1 ]
机构
[1] Tianjin Univ, Coll Intelligence & Comp, Tianjin Key Lab Adv Networking TANK, Tianjin 300350, Peoples R China
基金
中国国家自然科学基金;
关键词
Mobile edge caching; multi-cell cooperative networks; joint caching and recommendation; multi-agent reinforcement learning; NETWORKS; DELIVERY; DESIGN; POLICY;
D O I
10.1109/TMC.2023.3297213
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In 5G small cell networks, edge caching is a key technique to alleviate the backhaul burden by caching user desired contents at network edges such as small base stations (SBSs). However, due to storage space limitation and diverse user preference patterns, a single SBS is unable to cache all the user desired contents and thus leading to low caching efficiency. In this paper, we propose a recommendation-driven multi-cell cooperative caching strategy to improve the caching efficiency. The idea is to aggregate the storage spaces of multiple SBSs into a large shared resource pool, and guide users to access cached contents by content recommendation. First, we formulate the joint cooperative caching and recommendation problem as a multi-agent multi-armed bandit (MAMAB) problem with the aim of minimizing the average download latency. Then, we propose a multi-agent reinforcement learning (MARL)-based algorithm, MARL-JCR, to solve the problem in a fully distributed manner with limited information exchange among the agents. We also develop a modified combinatorial upper confidence bound algorithm to reduce each agent's decision space to reduce computational complexity. The experiment results evaluated on the MovieLens dataset show MARL-JCR decreases the average download latency by up to 60% as compared with the state-of-the-art solutions.
引用
收藏
页码:4764 / 4776
页数:13
相关论文
共 43 条
[1]   A Stochastic Geometry Framework for Analyzing Pairwise-Cooperative Cellular Networks [J].
Baccelli, Francois ;
Giovanidis, Anastasios .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (02) :794-808
[2]   Jointly Optimizing Content Caching and Recommendations in Small Cell Networks [J].
Chatzieleftheriou, Livia Elena ;
Karaliopoulos, Merkouris ;
Koutsopoulos, Iordanis .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (01) :125-138
[3]  
Chatzieleftheriou M., 2017, P IEEE C COMP COMM, P1
[4]   Caching Policy for Cache-Enabled D2D Communications by Learning User Preference [J].
Chen, Binqiang ;
Yang, Chenyang .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (12) :6586-6601
[5]  
Chen W., 2013, Proceedings of the 30th International Conference on Machine Learning (ICML-13), V28, P151
[6]   Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data [J].
Cheng, Peng ;
Ma, Chuan ;
Ding, Ming ;
Hu, Yongjun ;
Lin, Zihuai ;
Li, Yonghui ;
Vucetic, Branka .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (02) :1663-1676
[7]   Approximation Guarantees for the Joint Optimization of Caching and Recommendation [J].
Costantini, Marina ;
Spyropoulos, Thrasyvoulos ;
Giannakas, Theodoros ;
Sermpezis, Pavlos .
ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2020,
[8]   Decentralized Coded Caching for Shared Caches [J].
Dutta, Monolina ;
Thomas, Anoop .
IEEE COMMUNICATIONS LETTERS, 2021, 25 (05) :1458-1462
[9]  
Gill P, 2007, IMC'07: PROCEEDINGS OF THE 2007 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P15
[10]   The Netflix Recommender System: Algorithms, Business Value, and Innovation [J].
Gomez-Uribe, Carlos A. ;
Hunt, Neil .
ACM TRANSACTIONS ON MANAGEMENT INFORMATION SYSTEMS, 2016, 6 (04)