Cocktail Edge Caching: Ride Dynamic Trends of Content Popularity with Ensemble Learning
Tongyu Zong, Chen Li, Yuanyuan Lei, Guangyu Li, Houwei Cao, Yong Liu

TL;DR
This paper introduces Cocktail Edge Caching, an ensemble learning approach that adaptively combines multiple caching policies to effectively handle dynamic content popularity and heterogeneity in edge caching environments.
Contribution
It proposes a novel ensemble learning framework for edge caching that dynamically selects and combines policies using deep neural networks and reinforcement learning.
Findings
Outperforms single caching policies in various scenarios
Enhances robustness of caching strategies
Demonstrates effectiveness on real content request data
Abstract
Edge caching will play a critical role in facilitating the emerging content-rich applications. However, it faces many new challenges, in particular, the highly dynamic content popularity and the heterogeneous caching configurations. In this paper, we propose Cocktail Edge Caching, that tackles the dynamic popularity and heterogeneity through ensemble learning. Instead of trying to find a single dominating caching policy for all the caching scenarios, we employ an ensemble of constituent caching policies and adaptively select the best-performing policy to control the cache. Towards this goal, we first show through formal analysis and experiments that different variations of the LFU and LRU policies have complementary performance in different caching scenarios. We further develop a novel caching algorithm that enhances LFU/LRU with deep recurrent neural network (LSTM) based time-series…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Sharing Economy and Platforms · Recommender Systems and Techniques
