No-Regret Caching via Online Mirror Descent

We study an online caching problem in which requests can be served by a local cache to avoid retrieval costs from a remote server. The cache can update its state after a batch of requests and store an arbitrarily small fraction of each content. We study no-regret algorithms based on Online Mirror Descent (OMD) strategies. We show that the choice of OMD strategy depends on the request diversity present in a batch and that OMD caching policies may outperform traditional eviction-based policies.

[1]  P. Jelenkovic.  Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .

[2]  Bartlomiej Blaszczyszyn,et al.  Optimal geographic caching in cellular networks , 2014, 2015 IEEE International Conference on Communications (ICC).

[3]  Pietro Michiardi,et al.  Cache Policies for Linear Utility Maximization , 2018, IEEE/ACM Transactions on Networking.

[4]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[5]  Emilio Leonardi,et al.  Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles , 2018, IEEE Journal on Selected Areas in Communications.

[6]  Konstantinos Poularakis,et al.  Exploiting Caching and Multicast for 5G Wireless Networks , 2016, IEEE Transactions on Wireless Communications.

[7]  Sébastien Bubeck,et al.  Convex Optimization: Algorithms and Complexity , 2014, Found. Trends Mach. Learn..

[8]  George Karakostas,et al.  Exploitation of different types of locality for Web caches , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[9]  Gonzalo Navarro,et al.  Optimal Incremental Sorting , 2006, ALENEX.

[10]  Marco Cuturi,et al.  Computational Optimal Transport: With Applications to Data Science , 2019 .

[11]  Manfred K. Warmuth,et al.  Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension , 2006, NIPS.

[12]  Pietro Michiardi,et al.  Access-Time Aware Cache Algorithms , 2016, 2016 28th International Teletraffic Congress (ITC 28).

[13]  Florin Ciucu,et al.  Exact analysis of TTL cache networks , 2014, Perform. Evaluation.

[14]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[15]  Claudio Gentile,et al.  The Robustness of the p-Norm Algorithms , 1999, COLT '99.

[16]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[17]  Jun-Lin Lin,et al.  On the Diversity Constraints for Portfolio Optimization , 2013, Entropy.

[18]  Lachlan L. H. Andrew,et al.  A tale of two metrics: simultaneous bounds on competitiveness and regret , 2013, SIGMETRICS '13.

[19]  Martin Zinkevich,et al.  Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.

[20]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[21]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[22]  George Iosifidis,et al.  Learning to Cache With No Regrets , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[23]  Michele Garetto,et al.  A unified approach to the performance analysis of caching systems , 2013, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[24]  Donald F. Towsley,et al.  Joint cache resource allocation and request routing for in-network caching services , 2017, Comput. Networks.

[25]  Ronald Fagin,et al.  Asymptotic Miss Ratios over Independent References , 1977, J. Comput. Syst. Sci..

[26]  Donald F. Towsley,et al.  A utility optimization approach to network cache design , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[27]  Stratis Ioannidis,et al.  Adaptive Caching Networks With Optimality Guarantees , 2016, IEEE/ACM Transactions on Networking.

[28]  Donald F. Towsley,et al.  Performance evaluation of hierarchical TTL-based cache networks , 2014, Comput. Networks.

[29]  Weiran Wang,et al.  Projection onto the capped simplex , 2015, ArXiv.

[30]  Benny Van Houdt,et al.  TTL approximations of the cache replacement algorithms LRU(m) and h-LRU , 2017, Perform. Evaluation.

[31]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[32]  Shai Shalev-Shwartz,et al.  Online learning: theory, algorithms and applications (למידה מקוונת.) , 2007 .

[33]  K. Kiwiel.  Proximal Minimization Methods with Generalized Bregman Functions , 1997 .

[34]  Stratis Ioannidis,et al.  Distributed caching over heterogeneous mobile networks , 2010, SIGMETRICS '10.

[35]  Marc Teboulle,et al.  Mirror descent and nonlinear projected subgradient methods for convex optimization , 2003, Oper. Res. Lett..

[36]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[37]  Elias Koutsoupias,et al.  The k-server problem , 2009, Comput. Sci. Rev..

[38]  Paolo Giaccone,et al.  Temporal locality in today's content caching: why it matters and how to model it , 2013, CCRV.

[39]  Manfred K. Warmuth,et al.  The Weighted Majority Algorithm , 1994, Inf. Comput..

[40]  Abhishek Sinha,et al.  Fundamental Limits on the Regret of Online Network-Caching , 2020, SIGMETRICS.

[41]  Lazaros Gkatzikis,et al.  Adapting caching to audience retention rate , 2018, Comput. Commun..

[42]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[43]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[44]  Donald F. Towsley,et al.  On the Convergence of the TTL Approximation for an LRU Cache under Independent Stationary Request Processes , 2017, ACM Trans. Model. Perform. Evaluation Comput. Syst..

[45]  Joseph Naor,et al.  A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[46]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.

[47]  James R. Lee,et al.  k-server via multiscale entropic regularization , 2017, STOC.

[48]  Sara Alouf,et al.  Performance models for hierarchy of caches: Application to modern DNS caches , 2016, Perform. Evaluation.

[49]  Shai Shalev-Shwartz,et al.  Online Learning and Online Convex Optimization , 2012, Found. Trends Mach. Learn..

[50]  Philippe Robert,et al.  A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[51]  Elad Hazan,et al.  Introduction to Online Convex Optimization , 2016, Found. Trends Optim..