Existing content caching mechanisms are predominantly geared towards easy-access of content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate ‘dynamic’ content where new updates replace previous versions. This motivates us in this work to study the freshness-driven caching algorithm for dynamic content, which accounts for the changing nature of data content. In particular, we provide new models and analyses of the average operational cost both for the single-user and multi-user scenarios. In both scenarios, we characterize the performance of the optimal solution and develop algorithms to select the content and the update rate that the user(s) must employ to have low-cost access to fresh content. Moreover, our work reveals new and easy-to-calculate key metrics for quantifying the caching value of dynamic content in terms of their refresh rates, popularity, number of users in the multi-user group, and the fetching and update costs associated with the optimal decisions. We compare the proposed freshness-driven caching strategies with benchmark caching strategies like cache the most popular content. Results demonstrate that freshness-driven caching strategies considerably enhance the utilization of the edge caches with possibly orders-of-magnitude cost reduction. Furthermore, our investigations reveals that multi-user scenario, benefiting from the multicasting property of wireless service to update the cache content, can be cost effective compared to single user caching, as the number of users increases.
[1]
Yang Xiao,et al.
Update-Based Cache Access and Replacement in Wireless Data Access
,
2006,
IEEE Transactions on Mobile Computing.
[2]
Sem C. Borst,et al.
Distributed Caching Algorithms for Content Distribution Networks
,
2010,
2010 Proceedings IEEE INFOCOM.
[3]
Divyakant Agrawal,et al.
Enabling dynamic content caching for database-driven web sites
,
2001,
SIGMOD '01.
[4]
Kamesh Munagala,et al.
Web caching using access statistics
,
2001,
SODA '01.
[5]
Rajmohan Rajaraman,et al.
Placement Algorithms for Hierarchical Cooperative Caching
,
2001,
J. Algorithms.
[6]
Xuemin Shen,et al.
OUR: Optimal Update-based Replacement policy for cache in wireless data access networks with optimal effective hits and bandwidth requirements
,
2013,
Wirel. Commun. Mob. Comput..
[7]
Yong Tan,et al.
Analysis of a Least Recently Used Cache Management Policy for Web Browsers
,
2002,
Oper. Res..
[8]
Anthony Ephremides,et al.
Information freshness and popularity in mobile caching
,
2017,
2017 IEEE International Symposium on Information Theory (ISIT).
[9]
Yu Chen,et al.
Evaluation of edge caching/off loading for dynamic content delivery
,
2004,
IEEE Transactions on Knowledge and Data Engineering.