Jun 7, 2018 · In this paper, we instead conceptualize caching algorithms as complexity-limited online distribution learning algorithms and use this vantage ...
Abstract—Typical analysis of content caching algorithms using the metric of steady state hit probability under a stationary request process does not account ...
Apr 8, 2018 · Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms. Jian Li. ∗. , Srinivas Shakkottai. †. , John C.S. Lui. § and Vijay ...
A novel hybrid algorithm is proposed, adaptive-least recently used, that learns both faster and better the changes in the popularity and outperforms all ...
In this work, we consider adaptability of caching algorithms from two perspectives: (a) the accuracy of learning a fixed popularity distribution; and (b) the ...
People also ask
What is the most efficient caching algorithm?
What is the best cache replacement algorithm?
Li, Jian, Shakkottai, Srinivas, Lui, John C., and Subramanian, Vijay. "Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms". IEEE ...
Jian Li, Srinivas Shakkottai, John C. S. Lui, Vijay G. Subramanian: Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms.
Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms. Authors. Jian Li,Srinivas Shakkottai. John C. S. Lui. +1 authors.
在本文中，我们将缓存算法概念化为复杂度受限的在线分布学习算法，并利用这一优势从两个角度研究它们的适应性：1）学习固定流行度分布的准确性和2）学习项目流行度的速度.
Learning to cache with no regrets. LiJ. et al. Accurate learning or fast mixing? Dynamic adaptability of caching algorithms. IEEE J. Sel. Areas Commun. (2018).