Joint Optimization of Caching and Recommendation with Performance Guarantee for Effective Content Delivery in IoT
Source abstract
Abstract
Content caching and recommendation for content delivery over the Internet are two key techniques for improving the content delivery effectiveness determined by delivery efficiency and user satisfaction, which is increasingly important in the booming Internet of Things (IoT). While content caching seeks the “greatest common denominator” among users to reduce end-to-end delay in content delivery, personalized recommendation, on the contrary, emphasizes users’ differentiation to enhance user satisfaction. Existing studies typically address them separately rather than jointly due to their contradictory objectives. They focus mainly on heuristics and deep reinforcement learning methods without the provision of performance guarantees, which are required in many real-world applications. In this paper, we study the problem of joint optimization of caching and recommendation in which recommendation is performed in the cached contents instead of purely according to users’ preferences, as in the existing work. We show the NP-hardness of this problem and present a greedy solution with a performance guarantee by first performing content caching according to user request probability without considering recommendations to maximize the aggregated request probability on cached contents and then recommendations from cached contents to incorporate user preferences for cache hit rate maximization. We prove that this problem has a monotonically increasing and submodular objective function and develop an efficient algorithm that achieves a 1−1e≈0.63 approximation ratio to the optimal solution. Experimental results demonstrate that our algorithm dramatically improves the popular least-recently used (LRU) algorithm. We also show experimental evaluations of hit rate variations by Jensen–Shannon Divergence on different parameter settings of cache capacity and user preference distortion limit, which can be used as a reference for appropriate parameter settings to balance user preferences and cache hit rate for Internet content delivery.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Caching and Content Delivery · Recommender Systems and Techniques · Advanced Wireless Network Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 511400, China
School of Engineering and Technology, Central Queensland University, Brisbane 4000, Australia
School of Information and Communication Technology, Griffith University, Gold Coast 4215, Australia
Funding
Department of Environment and Science of Queensland State Government under the Quantum Challenge 2032 Program · Science and Technology Development Fund of Macao · Key-Area Research and Development Plan of Guangdong Province
References (30)
Show source-provided references
1. Content Delivery Networks: State of the Art, Trends, and Future Roadmap
2. A Survey of Edge Caching: Key Issues and Challenges10.26599/TST.2023.9010051 ↗
3. Tolly, K. (2025, July 13). A Guide to CDN Technology. Available online: https://www.techtarget.com/searchnetworking/feature/Content-delivery-network-services-The-benefits-of-CDNs.
4. James, H. (2025, July 13). 25 Best CDN Providers. Available online: https://linuxblog.io/best-cdn-providers.
5. Gasmi, S., Bouhadada, T., and Benmachiche, A. (2021, January 4–5). Survey on Recommendation Systems. Proceedings of the 10th International Conference on Information Systems And Technologies, New York, NY, USA.10.1145/3447568.3448518 ↗
6. The Netflix Recommender System: Algorithms, Business Value, and Innovation
7. Ke, Z., Cheng, M., Zhou, X., Li, K., and Qiu, T. (2020). Joint Cooperative Content Caching and Recommendation in Mobile Edge-Cloud Networks. Web and Big Data, Proceedings of the 4th International Joint Conference, APWeb-WAIM 2020, Tianjin, China, 18–20 September 2020, Springer.10.1007/978-3-030-60259-8_31 ↗
8. Optimizing for Video Storage Networking with Recommender Systems10.1002/bltj.20536 ↗
9. Cache-Centric Video Recommendation: An Approach to Improve the Efficiency of YouTube Caches10.1145/2716310 ↗
10. Dernbach, S., Taft, N., Kurose, J., Weinsberg, U., Diot, C., and Ashkan, A. (2016, January 10–14). Cache content-selection policies for streaming video services. Proceedings of the 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA.10.1109/INFOCOM.2016.7524619 ↗
11. Sermpezis, P., Spyropoulos, T., Vigneri, L., and Giannakas, T. (2017, January 4–8). Femto-Caching with Soft Cache Hits: Improving Performance with Related Content Recommendation. Proceedings of the 2017 IEEE Global Communications Conference, GLOBECOM 2017, Singapore.10.1109/GLOCOM.2017.8254035 ↗
12. On the potential of recommendation technologies for efficient content delivery networks10.1145/2500098.2500109 ↗
13. Vieira, D., Delgado, C., and Menasché, D. (2015, January 8–12). Content recommendation and service costs in swarming systems. Proceedings of the 2015 IEEE International Conference on Communications, ICC 2015, London, UK.
14. Proactive Content Download and User Demand Shaping for Data Networks10.1109/TNET.2014.2346694 ↗
15. Jointly Optimizing Content Caching and Recommendations in Small Cell Networks10.1109/TMC.2018.2831690 ↗
16. Giannakas, T., Sermpezis, P., and Spyropoulos, T. (2018, January 12–15). Show me the Cache: Optimizing Cache-Friendly Recommendations for Sequential Content Access. Proceedings of the 2018 IEEE 19th International Symposium on “A World of Wireless, Mobile And Multimedia Networks” (WoWMoM), Chania, Greece.10.1109/WoWMoM.2018.8449731 ↗
17. Soft Cache Hits: Improving Performance Through Recommendation and Delivery of Related Content10.1109/JSAC.2018.2844983 ↗
18. An Approximation Algorithm for Joint Caching and Recommendations in Cache Networks10.1109/TNSM.2022.3150961 ↗
19. Learning-Based Cooperative Cache Strategy Integrating Content Recommendation in IoV10.1109/TVT.2024.3460873 ↗
20. Su, S., Chen, X., Wang, Y., Wu, Y., Zhang, Z., Zhan, K., Wang, B., and Gai, K. (2024, January 14–18). RPAF: A Reinforcement Prediction-Allocation Framework for Cache Allocation in Large-Scale Recommender Systems. Proceedings of the 18th ACM Conference on Recommender Systems, New York, NY, USA.10.1145/3640457.3688128 ↗
21. Chen, X., Zhang, G., Wang, Y., Wu, Y., Su, S., Zhan, K., and Wang, B. (2024, January 13–17). Cache-Aware Reinforcement Learning in Large-Scale Recommender Systems. Proceedings of the Companion Proceedings of the ACM Web Conference 2024, Singapore.10.1145/3589335.3648326 ↗
22. Joint User-Side Recommendation and D2D-Assisted Offloading for Cache-Enabled Cellular Networks with Mobility Consideration10.1109/TWC.2023.3258525 ↗
23. Caching Efficiency Maximization for Device-to-Device Communication Networks: A Recommend to Cache Approach10.1109/TWC.2021.3075278 ↗
24. Zhang, X., Hui, H., Chen, W., and Han, Z. (2021, January 7–11). Joint Pushing, Pricing, and Recommendation for Cache-enabled Radio Access Networks. Proceedings of the 2021 IEEE Global Communications Conference (GLOBECOM), Madrid, Spain.10.1109/GLOBECOM46510.2021.9685638 ↗
25. Exploiting Coding and Recommendation to Improve Cache Efficiency of Reliability-Aware Wireless Edge Caching Networks10.1109/TWC.2021.3081682 ↗
26. Tsigkari, D., Iosifidis, G., and Spyropoulos, T. (2021, January 7–11). Split the cash from cache-friendly recommendations. Proceedings of the 2021 IEEE Global Communications Conference (GLOBECOM), Madrid, Spain.10.1109/GLOBECOM46510.2021.9685088 ↗
27. Tharakan, K., Bharath, B., and Bhatia, V. (2021, January 25–28). Joint Edge Content Cache Placement and Recommendation: Bayesian Approach. Proceedings of the 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring), Helsinki, Finland.10.1109/VTC2021-Spring51267.2021.9448631 ↗
28. Cooperative Cache-Aware Recommendation System for Multiple Internet Content Providers10.1109/LWC.2020.3014266 ↗
29. An analysis of approximations for maximizing submodular set functions—I10.1007/BF01588971 ↗
30. Online over time processing of combinatorial problems10.1007/s10601-018-9287-4 ↗