Abstract
We study a cache network under arbitrary adversarial request arrivals. We propose a distributed online policy based on the online tabular greedy algorithm. Our distributed policy achieves sublinear (1-1/e)-regret, also in the case when update costs cannot be neglected. Numerical evaluation over several topologies supports our theoretical results and demonstrates that our algorithm outperforms state-of-art online cache algorithms.
- Alekh Agarwal, Daniel Hsu, Satyen Kale, John Langford, Lihong Li, and Robert Schapire. 2014. Taming the monster: A fast and simple algorithm for contextual bandits. In International Conference on Machine Learning. PMLR, 1638--1646.Google Scholar
- Alexander A Ageev and Maxim I Sviridenko. 2004. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization , Vol. 8, 3 (2004), 307--328. https://doi.org/10.1023/b:joco.0000038913.96607.c2Google Scholar
Cross Ref
- Sara Alouf, Nicaise Choungmo Fofack, and Nedko Nedkov. 2016. Performance models for hierarchy of caches: Application to modern DNS caches. Performance Evaluation , Vol. 97 (2016), 57--82.Google Scholar
Digital Library
- Lachlan Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, and Adam Wierman. 2013. A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. SIGMETRICS Perform. Eval. Rev. , Vol. 41, 1 (June 2013), 329--330. https://doi.org/10.1145/2494232.2465533Google Scholar
Digital Library
- Sanjeev Arora, Elad Hazan, and Satyen Kale. 2012. The multiplicative weights update method: a meta-algorithm and applications. Theory of Computing , Vol. 8, 1 (2012), 121--164.Google Scholar
Cross Ref
- Jean-Yves Audibert, Rémi Munos, and Csaba Szepesvári. 2009. Exploration--exploitation tradeoff using variance estimates in multi-armed bandits. Theoretical Computer Science , Vol. 410, 19 (2009), 1876--1902.Google Scholar
Digital Library
- Daniel S Berger, Philipp Gland, Sahil Singla, and Florin Ciucu. 2014. Exact analysis of TTL cache networks. Performance Evaluation , Vol. 79 (2014), 2--23. https://doi.org/10.1016/j.peva.2014.07.001Google Scholar
Cross Ref
- Omar Besbes, Yonatan Gur, and Assaf Zeevi. 2015. Non-stationary stochastic optimization. Operations research , Vol. 63, 5 (2015), 1227--1244.Google Scholar
- Lilian Besson and Emilie Kaufmann. 2019. The generalized likelihood ratio test meets klucb: an improved algorithm for piece-wise non-stationary bandits. Proceedings of Machine Learning Research vol XX , Vol. 1 (2019), 35.Google Scholar
- Rajarshi Bhattacharjee, Subhankar Banerjee, and Abhishek Sinha. 2020. Fundamental Limits on the Regret of Online Network-Caching. Proc. ACM Meas. Anal. Comput. Syst. , Vol. 4, 2, Article 25 (June 2020), bibinfonumpages31 pages. https://doi.org/10.1145/3392143Google Scholar
Digital Library
- Allan Borodin, Nathan Linial, and Michael E. Saks. 1992. An Optimal On-line Algorithm for Metrical Task System . J. ACM , Vol. 39, 4 (Oct. 1992), 745--763. https://doi.org/10.1145/146585.146588Google Scholar
Digital Library
- Sem Borst, Varun Gupta, and Anwar Walid. 2010. Distributed caching algorithms for content distribution networks. In IEEE Conference on Computer Communications (INFOCOM 2010). 1--9. https://doi.org/10.1109/INFCOM.2010.5461964Google Scholar
Cross Ref
- Sébastien Bubeck. 2015. Convex Optimization: Algorithms and Complexity. Foundations and Trends in Machine Learning , Vol. 8, 3--4 (2015), 231--357.Google Scholar
Digital Library
- Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. 2007. Maximizing a submodular set function subject to a matroid constraint. In International Conference on Integer Programming and Combinatorial Optimization. Springer, 182--196.Google Scholar
Digital Library
- Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrák. 2011. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. , Vol. 40, 6 (2011), 1740--1766.Google Scholar
Digital Library
- Nicolo Cesa-Bianchi and Gabor Lugosi. 2006. Prediction, Learning, and Games .Cambridge University Press. https://doi.org/10.1017/CBO9780511546921Google Scholar
Digital Library
- TH Hubert Chan, Zhiyi Huang, Shaofeng H-C Jiang, Ning Kang, and Zhihao Gavin Tang. 2017. Online submodular maximization with free disposal: Randomization beats for partition matroids. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1204--1223.Google Scholar
- Hao Che, Ye Tung, and Zhijun Wang. 2002. Hierarchical web caching systems: Modeling, design and experimental results. IEEE Journal on Selected Areas in Communications , Vol. 20, 7 (2002), 1305--1314. https://doi.org/10.1109/JSAC.2002.801752Google Scholar
Digital Library
- Chandra Chekuri, Jan Vondrak, and Rico Zenklusen. 2010. Dependent randomized rounding via exchange properties of combinatorial structures. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE, 575--584.Google Scholar
Digital Library
- Lin Chen, Christopher Harshaw, Hamed Hassani, and Amin Karbasi. 2018a. Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity. In International Conference on Machine Learning . 814--823.Google Scholar
- Lin Chen, Hamed Hassani, and Amin Karbasi. 2018b. Online Continuous Submodular Maximization. In International Conference on Artificial Intelligence and Statistics. 1896--1905.Google Scholar
- Weibo Chu, Mostafa Dehghan, John CS Lui, Don Towsley, and ZhiLi Zhang. 2018. Joint cache resource allocation and request routing for in-network caching services. Computer Networks , Vol. 131 (2018), 1--14. https://doi.org/10.1016/j.comnet.2017.11.009Google Scholar
Cross Ref
- Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire. 2011. Contextual bandits with linear payoff functions. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 208--214.Google Scholar
- Edith Cohen and Scott Shenker. 2002. Replication strategies in unstructured peer-to-peer networks. In ACM SIGCOMM Computer Communication Review, Vol. 32. ACM, 177--190.Google Scholar
Digital Library
- Mostafa Dehghan, Laurent Massoulie, Don Towsley, Daniel Menasche, and YC Tay. 2016. A utility optimization approach to network cache design. In IEEE Conference on Computer Communications (INFOCOM 2016) .Google Scholar
Digital Library
- Miroslav Dudik, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, and Tong Zhang. 2011. Efficient optimal learning for contextual bandits. In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence. 169--178.Google Scholar
Digital Library
- Ronald Fagin. 1977. Asymptotic miss ratios over independent references. J. Comput. System Sci. , Vol. 14, 2 (1977), 222 -- 250.Google Scholar
Cross Ref
- Yingjie Fei, Zhuoran Yang, Zhaoran Wang, and Qiaomin Xie. 2020. Dynamic Regret of Policy Optimization in Non-Stationary Environments. In Advances in Neural Information Processing Systems (NeurIPS) .Google Scholar
- Yuval Filmus and Justin Ward. 2014. Monotone submodular maximization over a matroid via non-oblivious local search. SIAM J. Comput. , Vol. 43, 2 (2014), 514--542.Google Scholar
Cross Ref
- Marshall L Fisher, George L Nemhauser, and Laurence A Wolsey. 1978. An analysis of approximations for maximizing submodular set functions-II. In Polyhedral combinatorics . Springer, 73--87.Google Scholar
- Nicaise Choungmo Fofack, Philippe Nain, Giovanni Neglia, and Don Towsley. 2014. Performance evaluation of hierarchical TTL-based cache networks . Computer Networks , Vol. 65 (2014), 212 -- 231. https://doi.org/10.1016/j.comnet.2014.03.006Google Scholar
Cross Ref
- Christine Fricker, Philippe Robert, and James Roberts. 2012. A versatile and accurate approximation for LRU cache performance. In 2012 24th International Teletraffic Congress (ITC 24). IEEE, 1--8.Google Scholar
- Daniel Golovin, Andreas Krause, and Matthew Streeter. 2014. Online submodular maximization under a matroid constraint with application to learning assignments. arXiv preprint arXiv:1407.1082 (2014).Google Scholar
- Anupam Gupta, Aaron Roth, Grant Schoenebeck, and Kunal Talwar. 2010. Constrained non-monotone submodular maximization: Offline and secretary algorithms. In International Workshop on Internet and Network Economics. Springer, 246--257.Google Scholar
Cross Ref
- Salah Eddine Hajri and Mohamad Assaad. 2017. Energy efficiency in cache-enabled small cell networks with adaptive user clustering. IEEE Transactions on Wireless Communications , Vol. 17, 2 (2017), 955--968.Google Scholar
Cross Ref
- Eric Hall and Rebecca Willett. 2013. Dynamical models and tracking regret in online convex programming. In International Conference on Machine Learning. PMLR, 579--587.Google Scholar
- Eric C Hall and Rebecca M Willett. 2015. Online convex optimization in dynamic environments. IEEE Journal of Selected Topics in Signal Processing , Vol. 9, 4 (2015), 647--662.Google Scholar
Cross Ref
- Hamed Hassani, Mahdi Soltanolkotabi, and Amin Karbasi. 2017. Gradient methods for submodular maximization. In Advances in Neural Information Processing Systems. 5841--5851.Google Scholar
- Elad Hazan et almbox. 2016. Introduction to online convex optimization. Foundations and Trends® in Optimization , Vol. 2, 3--4 (2016), 157--325.Google Scholar
- Stratis Ioannidis, Laurent Massoulié, and Augustin Chaintreau. 2010. Distributed caching over heterogeneous mobile networks. In Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems . 311--322.Google Scholar
Digital Library
- Stratis Ioannidis and Edmund Yeh. 2016. Adaptive caching networks with optimality guarantees. ACM SIGMETRICS Performance Evaluation Review , Vol. 44, 1 (2016), 113--124.Google Scholar
Digital Library
- Stratis Ioannidis and Edmund Yeh. 2018a. Adaptive caching networks with optimality guarantees. IEEE/ACM Transactions on Networking , Vol. 26, 2 (2018), 737--750. https://doi.org/10.1109/TNET.2018.2793581Google Scholar
Digital Library
- Stratis Ioannidis and Edmund Yeh. 2018b. Jointly Optimal Routing and Caching for Arbitrary Network Topologies. IEEE Journal on Selected Areas in Communications , Vol. 36, 6 (2018), 1258--1275. https://doi.org/10.1109/JSAC.2018.2844981Google Scholar
Digital Library
- Van Jacobson, Diana K Smetters, James D Thornton, Michael F Plass, Nicholas H Briggs, and Rebecca L Braynard. 2009. Networking named content. In Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. ACM, 1--12. https://doi.org/10.1145/1658939.1658941Google Scholar
Digital Library
- Thomas Jaksch, Ronald Ortner, and Peter Auer. 2010. Near-optimal Regret Bounds for Reinforcement Learning. Journal of Machine Learning Research , Vol. 11, 4 (2010).Google Scholar
- Predrag R. Jelenkovic. 1999. Asymptotic Approximation of the Move-to-Front Search Cost Distribution and Least-Recently Used Caching Fault Probabilities. The Annals of Applied Probability , Vol. 9, 2 (1999), 430--464.Google Scholar
Cross Ref
- Bo Jiang, Philippe Nain, and Don Towsley. 2018. On the Convergence of the TTL Approximation for an LRU Cache Under independent Stationary Request Processes. ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) , Vol. 3, 4 (2018), 1--31. https://doi.org/10.1145/3239164Google Scholar
Digital Library
- Zohar S Karnin and Oren Anava. 2016. Multi-armed bandits: Competing with optimal sequences. Advances in Neural Information Processing Systems , Vol. 29 (2016), 199--207.Google Scholar
- N Bora Keskin and Assaf Zeevi. 2017. Chasing demand: Learning and earning in a changing environment. Mathematics of Operations Research , Vol. 42, 2 (2017), 277--307.Google Scholar
Digital Library
- Robert Kleinberg, Aleksandrs Slivkins, and Eli Upfal. 2008. Multi-armed bandits in metric spaces. In Proceedings of the fortieth annual ACM symposium on Theory of computing. 681--690.Google Scholar
Digital Library
- Elias Koutsoupias. 2009. The k-server Problem. Computer Science Review , Vol. 3, 2 (May 2009), 105--118. https://doi.org/10.1016/j.cosrev.2009.04.002Google Scholar
Digital Library
- Nikolaos Laoutaris, Sofia Syntila, and Ioannis Stavrakakis. 2004. Meta algorithms for hierarchical Web caches. In IEEE International Conference on Performance, Computing, and Communications, 2004. 445--452. https://doi.org/10.1109/PCCC.2004.1395054Google Scholar
Cross Ref
- Emilio Leonardi and Giovanni Neglia. 2018. Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles. IEEE Journal on Selected Areas in Communications , Vol. 36, 6 (June 2018), 1276--1285. https://doi.org/10.1109/JSAC.2018.2844982Google Scholar
Digital Library
- Jian Li, Truong Khoa Phan, Wei Koong Chai, Daphne Tuncer, George Pavlou, David Griffin, and Miguel Rio. 2018. Dr-cache: Distributed resilient caching with latency guarantees. In IEEE Conference on Computer Communications (INFOCOM 2018). 441--449. https://doi.org/10.1109/INFOCOM.2018.8486316Google Scholar
Digital Library
- Yuanyuan Li and Stratis Ioannidis. 2020. Universally Stable Cache Networks. In IEEE INFOCOM 2020-IEEE Conference on Computer Communications. IEEE.Google Scholar
- Boxi Liu, Konstantinos Poularakis, Leandros Tassiulas, and Tao Jiang. 2019. Joint Caching and Routing in Congestible Networks of Arbitrary Topology. IEEE Internet of Things Journal , Vol. 6, 6 (2019), 10105--10118. https://doi.org/10.1109/JIOT.2019.2935742Google Scholar
Cross Ref
- Yuezhou Liu, Yuanyuan Li, Qian Ma, Stratis Ioannidis, and Edmund Yeh. 2020. Fair caching networks. Performance Evaluation (2020). https://doi.org/10.1016/j.peva.2020.102138.Google Scholar
- Haipeng Luo, Chen-Yu Wei, Alekh Agarwal, and John Langford. 2018. Efficient contextual bandits in non-stationary worlds. In Conference On Learning Theory. PMLR, 1739--1776.Google Scholar
- Mark Manasse, Lyle McGeoch, and Daniel Sleator. 1988. Competitive Algorithms for On-Line Problems. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (Chicago, Illinois, USA) (STOC '88). Association for Computing Machinery, New York, NY, USA, 322--333. https://doi.org/10.1145/62212.62243Google Scholar
Digital Library
- Weichao Mao, Kaiqing Zhang, Ruihao Zhu, David Simchi-Levi, and Tamer Basar. 2021. Near-Optimal Model-Free Reinforcement Learning in Non-Stationary Episodic MDPs. In International Conference on Machine Learning. PMLR, 7447--7458.Google Scholar
- Aryan Mokhtari, Hamed Hassani, and Amin Karbasi. 2018. Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap. In International Conference on Artificial Intelligence and Statistics. 1886--1895.Google Scholar
- Samrat Mukhopadhyay and Abhishek Sinha. 2021. Online Caching with Optimal Switching Regret. In 2021 IEEE International Symposium on Information Theory (ISIT). 1546--1551. https://doi.org/10.1109/ISIT45174.2021.9517925Google Scholar
Digital Library
- Giovanni Neglia, Emilio Leonardi, Guilherme Iecker Ricardo, and Thrasyvoulos Spyropoulos. 2021. A Swiss Army Knife for Online Caching in Small Cell Networks. IEEE/ACM Transactions on Networking (2021).Google Scholar
- George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions. Mathematical Programming , Vol. 14, 1 (1978), 265--294.Google Scholar
Digital Library
- Debjit Paria, Krishnakumar, and Abhishek Sinha. 2020. Caching in Networks without Regret. arxiv: 2009.08228 [cs.IT]Google Scholar
- G. S. Paschos, A. Destounis, L. Vigneri, and G. Iosifidis. 2019. Learning to Cache With No Regrets. In IEEE INFOCOM 2019 - IEEE Conference on Computer Communications. 235--243.Google Scholar
- Gabriel Peyré, Marco Cuturi, et almbox. 2019. Computational Optimal Transport: With Applications to Data Science. Foundations and Trends® in Machine Learning , Vol. 11, 5--6 (2019), 355--607.Google Scholar
- Konstantinos Poularakis, George Iosifidis, Vasilis Sourlas, and Leandros Tassiulas. 2016. Exploiting caching and multicast for 5G wireless networks. IEEE Transactions on Wireless Communications , Vol. 15, 4 (2016), 2995--3007.Google Scholar
Digital Library
- Filip Radlinski, Robert Kleinberg, and Thorsten Joachims. 2008. Learning diverse rankings with multi-armed bandits. In Proceedings of the 25th international conference on Machine learning. 784--791.Google Scholar
Digital Library
- Dario Rossi and Giuseppe Rossini. 2011. Caching performance of content centric networks under multi-path routing (and more). Relatório técnico, Telecom ParisTech (2011), 1--6.Google Scholar
- Tareq Si Salem, Giovanni Neglia, and Stratis Ioannidis. 2021. No-Regret Caching via Online Mirror Descent. arxiv: 2101.12588 [cs.LG]Google Scholar
- Shai Shalev-Shwartz. 2012. Online Learning and Online Convex Optimization. Found. Trends Mach. Learn. , Vol. 4, 2 (Feb. 2012), 107--194. https://doi.org/10.1561/2200000018Google Scholar
Digital Library
- Karthikeyan Shanmugam, Negin Golrezaei, Alexandros G Dimakis, Andreas F Molisch, and Giuseppe Caire. 2013. Femtocaching: Wireless content delivery through distributed caching helpers. IEEE Transactions on Information Theory , Vol. 59, 12 (2013), 8402--8413.Google Scholar
Digital Library
- Tareq Si Salem, Giovanni Neglia, and Stratis Ioannidis. 2021. No-Regret Caching via Online Mirror Descent. In IEEE International Conference on Communications (ICC).Google Scholar
Cross Ref
- Daniel D. Sleator and Robert E. Tarjan. 1985. Amortized Efficiency of List Update and Paging Rules . Commun. ACM , Vol. 28, 2 (Feb. 1985), 202--208. https://doi.org/10.1145/2786.2793Google Scholar
Digital Library
- Matthew Streeter and Daniel Golovin. 2008. An online algorithm for maximizing submodular functions. Advances in Neural Information Processing Systems , Vol. 21 (2008), 1577--1584.Google Scholar
- Matthew Streeter, Daniel Golovin, and Andreas Krause. 2009. Online learning of assignments. Advances in neural information processing systems , Vol. 22 (2009), 1794--1802.Google Scholar
- Ronald W Wolff. 1982. Poisson arrivals see time averages. Operations Research , Vol. 30, 2 (1982), 223--231.Google Scholar
Digital Library
- Zhengyu Yang, Danlin Jia, Stratis Ioannidis, Ningfang Mi, and Bo Sheng. 2018. Intermediate data caching optimization for multi-stage and parallel big data frameworks. In 2018 IEEE 11th International Conference on Cloud Computing. 277--284. https://doi.org/10.1109/CLOUD.2018.00042Google Scholar
Cross Ref
- Mingrui Zhang, Lin Chen, Hamed Hassani, and Amin Karbasi. 2019. Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback.. In NeurIPS .Google Scholar
- Martin Zinkevich. 2003. Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In Proceedings of the Twentieth International Conference on International Conference on Machine Learning (Washington, DC, USA) (ICML'03). AAAI Press, 928--935.Google Scholar
Digital Library
Index Terms
Online Caching Networks with Adversarial Guarantees
Recommendations
Online Caching Networks with Adversarial Guarantees
SIGMETRICS '22We study a cache network under arbitrary adversarial request arrivals. We propose a distributed online policy based on the online tabular greedy algorithm. Our distributed policy achieves sublinear (1-1/e)-regret, also in the case when update costs ...
Online Caching Networks with Adversarial Guarantees
SIGMETRICS/PERFORMANCE '22: Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer SystemsWe study a cache network under arbitrary adversarial request arrivals. We propose a distributed online policy based on the online tabular greedy algorithm. Our distributed policy achieves sublinear (1-1/e)-regret, also in the case when update costs ...
Regret in Online Combinatorial Optimization
We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference between her realized loss and the minimal loss she would have achieved ...






Comments