Cache-Enabled Multicast Content Pushing With Structured Deep Learning

被引:14
作者
Chen, Qi [1 ]
Wang, Wei [1 ]
Chen, Wei [2 ]
Yu, F. Richard [3 ]
Zhang, Zhaoyang [1 ]
机构
[1] Zhejiang Univ, Coll Informat Sci & Elect Engn, Hangzhou 310027, Peoples R China
[2] Tsinghua Univ, Dept Elect Engn, Beijing 100084, Peoples R China
[3] Carleton Univ, Dept Syst & Comp Engn, Ottawa, ON K1S 5B6, Canada
基金
中国国家自然科学基金;
关键词
Couplings; Deep learning; Training; Neural networks; Multicast algorithms; Convolution; Upper bound; Wireless networks; edge caching; content pushing; deep learning; SMALL-CELL;
D O I
10.1109/JSAC.2021.3078493
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The cache-enabled multicast content pushing, which multicasts the content items to multiple users and caches them until requested, is a promising technique to alleviate the heavy network load by enhancing the traffic offloading. This, in turn, has called for the optimization of content pushing strategy while considering both the transmission and caching resources, which jointly result in the complicated coupling among pushing decisions and lead to high computational complexity. Unlike most existing approaches which simplify the pushing problem via bypassing the complicated coupling, in this paper, we propose a multicast content pushing strategy to maximize the offloaded traffic with the cost on content caching based on structured deep learning. Specifically, we design the convolution stage to extract the spatio-temporal correlations of one content item between different pushing decisions, and construct the fully-connected stage to capture the spatial coupling among the decisions of pushing different content items to different user devices. Moreover, to address the absence of the ground truth on multicast content pushing, we relax the transmission constraint to derive a performance upper bound for guiding the training direction. This relaxed problem is solved based on dynamic programming in a bottom-up manner. Compared to the state-of-the-art baselines including both the traditional model-based and the general neural network-based strategies, the proposed pushing strategy achieves significant performance gain in both the random-generated dataset and the real LastFM dataset. In addition, it is also shown that the proposed strategy is robust to the uncertainty of user request information.
引用
收藏
页码:2135 / 2149
页数:15
相关论文
共 35 条
[1]  
Bastug E, 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), P161, DOI 10.1109/WIOPT.2015.7151068
[2]  
Blasco P, 2014, IEEE ICC, P1897, DOI 10.1109/ICC.2014.6883600
[3]  
Blasco P, 2014, IEEE INT SYMP INFO, P51, DOI 10.1109/ISIT.2014.6874793
[4]   LEARN TO CACHE: MACHINE LEARNING FOR NETWORK EDGE CACHING IN THE BIG DATA ERA [J].
Chang, Zheng ;
Lei, Lei ;
Zhou, Zhenyu ;
Mao, Shiwen ;
Ristaniemi, Tapani .
IEEE WIRELESS COMMUNICATIONS, 2018, 25 (03) :28-35
[5]   A polynomial time approximation scheme for the multiple knapsack problem [J].
Chekuri, C ;
Khanna, S .
SIAM JOURNAL ON COMPUTING, 2006, 35 (03) :713-728
[6]   Content Caching Oriented Popularity Prediction: A Weighted Clustering Approach [J].
Chen, Qi ;
Wang, Wei ;
Yu, F. Richard ;
Tao, Meixia ;
Zhang, Zhaoyang .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (01) :623-636
[7]   Content Pushing With Request Delay Information [J].
Chen, Wei ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (03) :1146-1161
[8]  
Chen WH, 2017, 2017 IEEE 19TH INTERNATIONAL CONFERENCE ON E-HEALTH NETWORKING, APPLICATIONS AND SERVICES (HEALTHCOM), DOI 10.1109/HealthCom.2017.8210846
[9]   Spatial Deep Learning for Wireless Scheduling [J].
Cui, Wei ;
Shen, Kaiming ;
Yu, Wei .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2019, 37 (06) :1248-1261
[10]  
Dai J, 2012, IEEE INFOCOM SER, P2444, DOI 10.1109/INFCOM.2012.6195634