Joint Optimization of Caching and Recommendation with Performance Guarantee for Effective Content Delivery in IoT

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.

Abstract licence: CC BY

26 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.