Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data

被引:36
作者
Cheng, Peng [1 ]
Ma, Chuan [1 ]
Ding, Ming [2 ]
Hu, Yongjun [3 ]
Lin, Zihuai [1 ]
Li, Yonghui [1 ]
Vucetic, Branka [1 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2000, Australia
[2] CSIRO, Data61, Eveleigh, NSW 2015, Australia
[3] Guangzhou Univ, Sch Management, Guangzhou 510006, Guangdong, Peoples R China
关键词
Wireless caching; individual content request probability (ICRP); recommendation systems; Bayesian machine learning; CONTENT DELIVERY; NETWORKS;
D O I
10.1109/TCOMM.2018.2878231
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Caching the most popular contents at the wireless network edge such as small-cell base stations (SBSs) is a smart way of reducing duplicated content transmissions and offloading the mobile data traffic in the network backhaul. Currently, most small-cell caching strategies are conceived, designed, and optimized based on the global content request probability (GCRP), with very limited consideration of the individual content request probability (ICRP) reflecting personal preferences. To enable more efficient wireless caching, in this paper, we propose a novel localized deterministic caching framework, drawing upon the recent advances in recommendation systems based on machine learning techniques. By introducing the concept of the rating matrix, we first propose a new Bayesian learning method to predict personal preferences and estimate the ICRP. This crucial information is then incorporated into our caching strategy for maximizing the system throughput, or equivalently, minimizing the download latency, where a deterministic caching algorithm based on reinforcement learning is proposed to optimize the content placement. To this end, we extend the framework to enable device-to-device (D2D) connections to further reduce the download delay, and also design a feedback mechanism to improve the accuracy in the ICRP estimation. Our simulation results verified that with the estimated ICRP and the proposed caching strategy, the proposed framework can significantly outperform the existing methods in terms of hit rate and system throughput.
引用
收藏
页码:1663 / 1676
页数:14
相关论文
共 43 条
  • [1] Adomavicius G., 2015, Recommender Systems Handbook, P191, DOI [DOI 10.1007/978-1-4899-7637-6, DOI 10.1145/1454008.1454068, 10.1007/978-1- 4899- 7637- 6_6, DOI 10.1007/978-1-4899-7637-6_6]
  • [2] Generalized pursuit learning schemes: New families of continuous and discretized learning automata
    Agache, M
    Oommen, BJ
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2002, 32 (06): : 738 - 749
  • [3] [Anonymous], IMC07 P 2007 ACM
  • [4] [Anonymous], IEEE INTERNET THINGS
  • [5] [Anonymous], 2017, Cisco7 Feb.
  • [6] [Anonymous], FOG AIDED WIRELESS N
  • [7] Cache-enabled small cell networks: modeling and tradeoffs
    Bastug, Ejder
    Bennis, Mehdi
    Kountouris, Marios
    Debbah, Merouane
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2015,
  • [8] Blasco P, 2014, IEEE ICC, P1897, DOI 10.1109/ICC.2014.6883600
  • [9] Recommender systems survey
    Bobadilla, J.
    Ortega, F.
    Hernando, A.
    Gutierrez, A.
    [J]. KNOWLEDGE-BASED SYSTEMS, 2013, 46 : 109 - 132
  • [10] Distributed Caching Algorithms for Content Distribution Networks
    Borst, Sem
    Gupta, Varun
    Walid, Anwar
    [J]. 2010 PROCEEDINGS IEEE INFOCOM, 2010,