Proactive Edge Caching in Content-Centric Networks with Massive Dynamic Content Requests

25Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Edge computing is a promising infrastructure evolution to reduce traffic loads and support low-latency communications. Furthermore, content-centric networks provide a natural solution to cache contents at edge nodes. However, it is a challenge for edge nodes to handle massive and highly dynamic content requests by users, and if without an efficient content caching strategy, the edge nodes will encounter high traffic load and latency due to increasing retrieval from content providers. This paper formulates a proactive edge caching problem to minimize the content retrieval cost at edge nodes. We exploit the inherent content caching and request aggregation mechanism in the content-centric networks to jointly minimize traffic load and content retrieval delay cost generated by the massive and dynamic content requests. We develop a Q-learning algorithm, which is an online optimal caching strategy, as it is adaptable to dynamic content popularity and content request intensity, and derive the long-term minimization of the content retrieval cost. Simulation results illustrate that the proposed algorithm can achieve a lower content retrieval cost compared with several baseline caching schemes.

Cite

CITATION STYLE

APA

Xu, X., Feng, C., Shan, S., Zhang, T., & Loo, J. (2020). Proactive Edge Caching in Content-Centric Networks with Massive Dynamic Content Requests. IEEE Access, 8, 59906–59921. https://doi.org/10.1109/ACCESS.2020.2983068

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free