A Content Caching Strategy Based on Demand Estimate Function in Small Cell Networks

In small cell networks, content caching is considered as an effective approach to reduce the traffic and increase the quality of experience of users. Because the knowledge about popularity distribution of content files is not available in advance, one of the main challenges in content caching is how to identify the most popular files and cache them into local limited storage on small base stations. In this paper, we propose an architecture for content caching system, a novel demand estimate function to work out the content popularity, and a cache placement strategy based on the demand estimate function. We develop a simulator implementing the proposed caching architecture and strategies to evaluate their performance. The simulation results show that the proposed strategy can achieve the stable state much faster than others. Moreover, we investigate the impact of system parameters such as cache size and the number and concentration of requests on the cache hits ratio, and the results confirm that our strategy outperforms the reference ones.

[1]  R. Michael Buehrer,et al.  Learning distributed caching strategies in small cell networks , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).

[2]  Elbiaze Halima,et al.  A Hybrid Regression Model for Video Popularity-Based Cache Replacement in Content Delivery Networks , 2016 .

[3]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Xiaofei Wang,et al.  Cache in the air: exploiting content caching and delivery techniques for 5G systems , 2014, IEEE Communications Magazine.

[5]  Dan Pei,et al.  To Cache or Not to Cache: The 3G Case , 2011, IEEE Internet Computing.

[6]  Mehdi Bennis,et al.  Big data meets telcos: A proactive caching perspective , 2015, Journal of Communications and Networks.

[7]  Deniz Gündüz,et al.  Multi-Access Communications With Energy Harvesting: A Multi-Armed Bandit Model and the Optimality of the Myopic Policy , 2015, IEEE Journal on Selected Areas in Communications.

[8]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[9]  Hongke Zhang,et al.  A Popularity-Based Cache Consistency Mechanism for Information-Centric Networking , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[10]  Azer Bestavros,et al.  GreedyDual* Web caching algorithm: exploiting the two sources of temporal locality in Web request streams , 2001, Comput. Commun..

[11]  Deniz Gündüz,et al.  Learning-based optimization of cache content in a small cell base station , 2014, 2014 IEEE International Conference on Communications (ICC).

[12]  Wei Chen,et al.  Combinatorial Multi-Armed Bandit: General Framework and Applications , 2013, ICML.

[13]  Setareh Maghsudi,et al.  Multi-armed bandits with application to 5G small cells , 2015, IEEE Wireless Communications.

[14]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[15]  Mark Haner,et al.  Cacheability analysis of HTTP traffic in an operational LTE network , 2013, 2013 Wireless Telecommunications Symposium (WTS).