{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:33:07Z","timestamp":1777761187931,"version":"3.51.4"},"reference-count":253,"publisher":"Emerald","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8,20]]},"abstract":"<jats:p>Caching refers to the act of replicating information a a faster (or closer) medium with the purpose of improving performance. This deceptively simple idea has given rise to some of the hardest optimization problems in the fields of computer systems, networking, and the Internet, many of which remain unsolved several years after their conception. While a wealth of research contributions exists from the topics of memory systems, data centers, Internet traffic, CDNs, and recently wireless networks, the literature is dispersed and overlapping at times. In this monograph, we take a unifying modeling view: by focusing on the fundamental underlying mathematical models, we re-organize the available material into a powerful framework for performing optimization of caching systems. This way, we aspire to present a solid background for the anticipated explosion in caching research, but also provide a didactic view into how engineers have managed to infuse mathematical models into the study of caching over the last 40 years.<\/jats:p>","DOI":"10.1561\/0100000104","type":"journal-article","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T05:22:26Z","timestamp":1592544146000},"page":"156-345","source":"Crossref","is-referenced-by-count":18,"title":["Cache Optimization Models and Algorithms"],"prefix":"10.1108","volume":"16","author":[{"given":"Georgios","family":"Paschos","sequence":"first","affiliation":[{"name":"Amazon.com ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Iosifidis","sequence":"additional","affiliation":[{"name":"Trinity College Dublin ,","place":["Ireland"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"TU Berlin ,","place":["Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"issue":"3","key":"2026032712274198800_ref001","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1109\/TNET.2013.2261542","article-title":"Content caching and scheduling in wireless networks with elastic and inelastic traffic","volume":"22","author":"Abedini","year":"2014","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref002","first-page":"1","article-title":"Optimal strategies and minimax lower bounds for online convex games","volume-title":"Proceedings of the Nineteenth Annual Conference on Computational Learning Theory (COLT)","author":"Abernethy","year":"2008"},{"key":"2026032712274198800_ref003","first-page":"143","article-title":"Zipf\u2019s law and the internet","volume":"3","author":"Adamic","year":"2002","journal-title":"Glottometrics"},{"issue":"3","key":"2026032712274198800_ref004","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","article-title":"Pipage rounding: A new method of constructing algorithms with proven performance guarantee","volume":"8","author":"Ageev","year":"2004","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"2026032712274198800_ref005","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/TNET.2014.2361935","article-title":"Content-centric wireless networks with limited buffers: When mobility hurts","volume":"24","author":"Alfano","year":"2014","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref006","first-page":"92","article-title":"Characterizing reference locality in the WWW","volume-title":"Proceedings of the IEEE Fourth International Conference on Parallel and Distributed Information Systems (PDIS)","author":"Almeida","year":"1996"},{"issue":"4","key":"2026032712274198800_ref007","doi-asserted-by":"crossref","first-page":"2114","DOI":"10.1109\/TNET.2015.2461599","article-title":"Optimal content placement for a large scale VoD system","volume":"24","author":"Applegate","year":"2016","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"2026032712274198800_ref008","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/65.844498","article-title":"A workload characterization study of the 1998 world cup web site","volume":"14","author":"Arlitt","year":"2000","journal-title":"IEEE Network"},{"issue":"3","key":"2026032712274198800_ref009","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/S0097539702416402","article-title":"Local search heuristics for k-median and facility location problems","volume":"33","author":"Arya","year":"2004","journal-title":"SIAM Journal on Computing"},{"key":"2026032712274198800_ref010","first-page":"492","article-title":"Predicting the future with social media","volume-title":"Proceedings of the IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology","author":"Asur","year":"2010"},{"issue":"3","key":"2026032712274198800_ref011","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TNET.2014.2307918","article-title":"Optimizing client association for load balancing and fairness in millimeter-wave wireless networks","volume":"23","author":"Athanasiou","year":"2015","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref012","volume-title":"Stochastic Analysis of Computer Storage","author":"Aven","year":"1987"},{"issue":"1","key":"2026032712274198800_ref013","doi-asserted-by":"crossref","DOI":"10.1145\/3084465","article-title":"A low complexity approach to distributed cooperative caching with geographic constraints","volume":"1","author":"Avrachenkov","year":"2017","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"issue":"12","key":"2026032712274198800_ref014","doi-asserted-by":"crossref","first-page":"5037","DOI":"10.1109\/TCOMM.2016.2615624","article-title":"Fundamental limits on throughput capacity in information centric networks","volume":"64","author":"Azimdoost","year":"2016","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712274198800_ref015","doi-asserted-by":"crossref","DOI":"10.1088\/1367-2630\/13\/4\/043004","article-title":"Zipf\u2019s law unzipped","author":"Baek","year":"2011"},{"issue":"4","key":"2026032712274198800_ref016","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/080715421","article-title":"Approximation algorithms for data placement problems","volume":"38","author":"Baev","year":"2008","journal-title":"SIAM J. Computing"},{"key":"2026032712274198800_ref017","first-page":"187","article-title":"CAR: Clock with adaptive replacement","volume-title":"Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST)","author":"Bansal","year":"2004"},{"issue":"6","key":"2026032712274198800_ref018","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/JCN.2015.000102","article-title":"Big data meets telcos: A proactive caching perspective","volume":"17","author":"Ba\u015ftu\u011f","year":"2015","journal-title":"Journal of Communications and Networks"},{"issue":"8","key":"2026032712274198800_ref019","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/MCOM.2014.6871674","article-title":"Living on the edge: The role of proactive caching in 5G wireless networks","volume":"52","author":"Ba\u015ftu\u011f","year":"2014","journal-title":"IEEE Communications Magazine"},{"key":"2026032712274198800_ref020","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/WIOPT.2015.7151068","article-title":"A transfer learning approach for cache-enabled wireless networks","author":"Ba\u015ftu\u011f","year":"2015","journal-title":"13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"},{"issue":"3","key":"2026032712274198800_ref021","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1145\/2229163.2229164","article-title":"Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location","volume":"8","author":"Bateni","year":"2012","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"2026032712274198800_ref022","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1140\/epjb\/e2007-00219-y","article-title":"Parameter estimation for power-law distributions by maximum likelihood methods","volume":"58","author":"Bauke","year":"2007","journal-title":"The European Physical Journal B"},{"key":"2026032712274198800_ref023","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","article-title":"Mirror descent and nonlinear projected subgradient methods for convex optimization","volume":"31","author":"Beck","year":"2003","journal-title":"Operations Research Letters"},{"issue":"8","key":"2026032712274198800_ref024","first-page":"2436","article-title":"Designing cost effective content distribution networks","volume":"34","author":"Bektas","year":"2007","journal-title":"Computers&Operations Research"},{"issue":"12","key":"2026032712274198800_ref025","first-page":"3860","article-title":"Exact algorithms for the joint object placement and request routing problem in content distribution networks","volume":"35","author":"Bektas","year":"2008","journal-title":"Computers&Operations Research"},{"issue":"2","key":"2026032712274198800_ref026","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","article-title":"A study of replacement algorithms for virtual storage computers","volume":"5","author":"Belady","year":"1966","journal-title":"IBM Systems Journal"},{"key":"2026032712274198800_ref027","article-title":"Online convex optimization and no-regret learning: Algorithms, guarantees and applications","author":"Belmega","year":"2018"},{"key":"2026032712274198800_ref028","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische Mathematik"},{"key":"2026032712274198800_ref029","article-title":"The netflix prize","volume-title":"Proceedings of the KDD Cup and Workshop","author":"Bennett","year":"2007"},{"issue":"12","key":"2026032712274198800_ref030","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1109\/TPDS.2008.25","article-title":"Replica placement and access policies in tree networks","volume":"19","author":"Benoit","year":"2008","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2026032712274198800_ref031","article-title":"Identity of King and Flajolet&al. formulae for LRU miss rate exact computation","author":"Berthet","year":"2016"},{"key":"2026032712274198800_ref032","volume-title":"Network Optimization: Continuous and Discrete Models","author":"Bertsekas","year":"1998"},{"key":"2026032712274198800_ref033","volume-title":"Nonlinear Programming","author":"Bertsekas","year":"1999"},{"key":"2026032712274198800_ref034","first-page":"782","article-title":"Estimates of the duality gap for large-scale separable non-convex optimization problems","volume-title":"Proceedings of the 21st IEEE Conference on Decision and Control (CDC)","author":"Bertsekas","year":"1982"},{"key":"2026032712274198800_ref035","volume-title":"Introduction to Linear Optimization","author":"Bertsimas","year":"1997"},{"key":"2026032712274198800_ref036","first-page":"25:1","article-title":"Fundamental limits on the regret of online network-caching","author":"Bhattacharjee","year":"2020","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems (SIGMETRICS)"},{"key":"2026032712274198800_ref037","first-page":"1093","article-title":"dReDBox: Materializing a full-stack rack-scale system prototype of a next-generation disaggregated datacenter","volume-title":"Proceedings of the IEEE Design, Automation&Test in Europe Conference&Exhibition (DATE)","author":"Bielski","year":"2018"},{"key":"2026032712274198800_ref038","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316962","volume-title":"Convergence of Probability Measures","author":"Billingsley","year":"1999"},{"key":"2026032712274198800_ref039","first-page":"51","article-title":"Multi-armed bandit optimization of cache content in wireless infostation networks","author":"Blasco","year":"2014","journal-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712274198800_ref040","first-page":"1","article-title":"Optimal geographic caching in cellular networks","volume-title":"Proceedings of the IEEE International Conference on Communications (ICC)","author":"Blaszczyszyn","year":"2015"},{"key":"2026032712274198800_ref041","first-page":"1","article-title":"Distributed caching algorithms for content distribution networks","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Borst","year":"2010"},{"issue":"356","key":"2026032712274198800_ref042","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1080\/01621459.1976.10480949","article-title":"Science and statistics","volume":"71","author":"Box","year":"1976","journal-title":"Journal of the American Statistical Association"},{"key":"2026032712274198800_ref043","first-page":"126","article-title":"Web caching and Zipf-like distributions: Evidence and implications","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Breslau","year":"1999"},{"key":"2026032712274198800_ref044","first-page":"182","article-title":"Maximizing a submodular set function subject to a matroid constraint","volume":"4513","author":"Calinescu","year":"2007","journal-title":"Integer Programming and Combinatorial Optimization"},{"key":"2026032712274198800_ref045","first-page":"1","article-title":"Cost-aware WWW proxy caching algorithms","author":"Cao","year":"1997","journal-title":"Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS)"},{"issue":"3","key":"2026032712274198800_ref046","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s11276-005-6615-6","article-title":"Improving wireless sensor network lifetime through power aware organization","volume":"11","author":"Cardei","year":"2005","journal-title":"Wireless Networks"},{"key":"2026032712274198800_ref047","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.comnet.2016.09.019","article-title":"Joint forwarding and caching with latency awareness in information centric networking","volume":"110","author":"Carofiglio","year":"2016","journal-title":"Computer Networks"},{"issue":"5","key":"2026032712274198800_ref048","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1067627.806596","article-title":"A simple and effective algorithm for virtual memory management","volume":"15","author":"Carr","year":"1981","journal-title":"SIGOPS Operating Systems Review"},{"issue":"2","key":"2026032712274198800_ref049","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/TNET.2004.826289","article-title":"Efficiently serving dynamic data at highly accessed web sites","volume":"12","author":"Challenger","year":"2004","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref050","first-page":"153","article-title":"A hierarchical internet object cache","volume-title":"Proceedings of the USENIX Technical Conference","author":"Chankhunthod","year":"1996"},{"key":"2026032712274198800_ref051","first-page":"378","article-title":"Improved combinatorial algorithms for the facility location and k-median problems","volume-title":"Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Charikar","year":"1999"},{"issue":"1","key":"2026032712274198800_ref052","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/jcss.2002.1882","article-title":"A constant-factor approximation algorithm for the k-median problem","volume":"65","author":"Charikar","year":"2002","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"2026032712274198800_ref053","doi-asserted-by":"crossref","first-page":"B17","DOI":"10.1016\/S0010-0277(98)00066-3","article-title":"Scale-invariance as a unifying psychological principle","volume":"69","author":"Chater","year":"1999","journal-title":"Cognition"},{"key":"2026032712274198800_ref054","first-page":"1","article-title":"Caching-aware recommendations: Nudging user preferences towards better caching performance","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Chatzieleftheriou","year":"2017"},{"issue":"7","key":"2026032712274198800_ref055","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/JSAC.2002.801752","article-title":"Hierarchical web caching systems: Modeling, design and experimental results","volume":"20","author":"Che","year":"2002","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032712274198800_ref056","first-page":"229","article-title":"Statistics and social network of YouTube videos","volume-title":"Proceedings of the IEEE International Workshop on Quality of Service (IWQoS)","author":"Cheng","year":"2008"},{"issue":"5","key":"2026032712274198800_ref057","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1109\/TMM.2013.2265531","article-title":"Understanding the characteristics of internet short video sharing: A YouTube-based measurement study","volume":"15","author":"Cheng","year":"2013","journal-title":"IEEE Transactions on Multimedia"},{"issue":"1","key":"2026032712274198800_ref058","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/JPROC.2006.887322","article-title":"Layering as optimization decomposition: A mathematical theory of network architectures","volume":"95","author":"Chiang","year":"2007","journal-title":"Proceedings of the IEEE"},{"key":"2026032712274198800_ref059","article-title":"Availability and popularity measurements of peer-to-peer file systems","volume-title":"Proceedings of SPIE 4868, Scalability and Traffic Control in IP Networks II","author":"Chu","year":"2002"},{"key":"2026032712274198800_ref060","article-title":"Annual Internet Report (2018\u20142023)","volume-title":"Cisco White Paper","author":"Cisco"},{"issue":"2","key":"2026032712274198800_ref061","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.9.2.145","article-title":"The greatest of a finite set of random variables","volume":"9","author":"Clark","year":"1961","journal-title":"Operations Research"},{"issue":"4","key":"2026032712274198800_ref062","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","article-title":"Power law distributions in empirical data","volume":"51","author":"Clauset","year":"2009","journal-title":"SIAM Review"},{"key":"2026032712274198800_ref063","article-title":"Analyzing adaptive cache replacement strategies","author":"Consuegra","year":"2017"},{"issue":"7","key":"2026032712274198800_ref064","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/JSAC.2002.802066","article-title":"Constrained mirror placement on the internet","volume":"20","author":"Cronin","year":"2002","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"2026032712274198800_ref065","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/TWC.2016.2622236","article-title":"Analysis and optimization of caching and multicasting in large-scale cache-enabled wireless networks","volume":"16","author":"Cui","year":"2017","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"2026032712274198800_ref066","article-title":"Characteristics of WWW client-based traces","author":"Cunha","year":"1995"},{"key":"2026032712274198800_ref067","first-page":"1158","article-title":"Collaborative hierarchical caching with dynamic request routing for massive content distribution","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Dai","year":"2012"},{"key":"2026032712274198800_ref068","first-page":"143","article-title":"An approximate analysis of the LRU and FIFO buffer replacement schemes","volume-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems (SIGMETRICS)","author":"Dan","year":"1990"},{"key":"2026032712274198800_ref069","article-title":"Power-law revisited: A large scale measurement study of P2P content popularity","volume-title":"Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS)","author":"D\u00e1n","year":"2010"},{"key":"2026032712274198800_ref070","volume-title":"Network and Discrete Location: Models, Algorithms and Applications","author":"Daskin","year":"2013"},{"issue":"3","key":"2026032712274198800_ref071","doi-asserted-by":"crossref","first-page":"1635","DOI":"10.1109\/TNET.2016.2636843","article-title":"On the complexity of optimal request routing and content caching in heterogeneous cache networks","volume":"25","author":"Dehghan","year":"2017","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref072","first-page":"1","article-title":"A utility optimization approach to network cache design","volume-title":"IEEE INFOCOM 2016\u2014 The 35th Annual IEEE International Conference on Computer Communications","author":"Dehghan","year":"2016"},{"key":"2026032712274198800_ref073","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1145\/1390156.1390191","article-title":"Efficient projections onto the l1-ball for learning in high dimensions","volume-title":"Proceedings of the 25th International Conference on Machine Learning (ICML)","author":"Duchi","year":"2008"},{"key":"2026032712274198800_ref074","first-page":"365","article-title":"Approximating connected facility location problems via random facility sampling and core detouring","author":"Eisenbrand","year":"2008","journal-title":"Proceedings of the ACM-SIAM SODA"},{"key":"2026032712274198800_ref075","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/2810156.2810168","article-title":"Performance and cost effectiveness of caching in mobile access networks","volume-title":"Proceedings of the 2nd ACM Conference on Information-Centric Networking","author":"Elayoubi","year":"2015"},{"key":"2026032712274198800_ref076","first-page":"4:1","article-title":"Economical caching","author":"Englert","year":"2013","journal-title":"ACM Transactions on Computation Theory"},{"issue":"2","key":"2026032712274198800_ref077","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(77)80014-7","article-title":"Asymptotic miss ratios over independent references","volume":"14","author":"Fagin","year":"1977","journal-title":"Journal of Computer and System Sciences"},{"key":"2026032712274198800_ref078","article-title":"Power laws in economics and elsewhere","volume-title":"Tech. rep","author":"Farmer","year":"2008"},{"key":"2026032712274198800_ref079","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/2433396.2433489","article-title":"On the prediction of popularity of trends and hits for user generated videos","volume-title":"Proceedings of the 6th ACM International Conference on Web Search and Data Mining","author":"Figueiredo","year":"2013"},{"issue":"12","key":"2026032712274198800_ref080","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"50","author":"Fisher","year":"2004","journal-title":"Management Science"},{"issue":"3","key":"2026032712274198800_ref081","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","article-title":"Birthday paradox, coupon collectors, caching algorithms and self-organizing search","volume":"39","author":"Flajolet","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"2026032712274198800_ref082","doi-asserted-by":"crossref","DOI":"10.1145\/1109557.1109624","article-title":"Tight approximation algorithms for maximum general assignment problems","volume-title":"Proceedings of the ACM SODA","author":"Fleischer","year":"2006"},{"key":"2026032712274198800_ref083","first-page":"1","article-title":"Analysis of TTL-based cache networks","volume-title":"6th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS)","author":"Fofack","year":"2012"},{"key":"2026032712274198800_ref084","volume-title":"Random Networks for Communication","author":"Franceschetti","year":"2007"},{"issue":"1","key":"2026032712274198800_ref085","article-title":"Collaboration opportunities for content delivery and network infrastructures","volume":"1","author":"Frank","year":"2013","journal-title":"Recent Advances in Networking"},{"key":"2026032712274198800_ref086","first-page":"8:1","article-title":"A versatile and accurate approximation for LRU cache performance","volume-title":"Proceedings of the 24th International Teletraffic Congress","author":"Fricker","year":"2012"},{"key":"2026032712274198800_ref087","first-page":"310","article-title":"Impact of traffic mix on caching performance in a content-centric network","volume-title":"Proceedings on the 2012 IEEE INFOCOM Conference on Computer Communications Workshops","author":"Fricker","year":"2012"},{"issue":"10","key":"2026032712274198800_ref088","doi-asserted-by":"crossref","first-page":"2682","DOI":"10.1109\/TMC.2016.2637901","article-title":"A tale of ten cities: Characterizing signatures of mobile traffic in urban areas","volume":"6","author":"Furno","year":"2017","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"3","key":"2026032712274198800_ref089","doi-asserted-by":"crossref","DOI":"10.1145\/2896380","article-title":"A unified approach to the performance analysis of caching systems","volume":"1","author":"Garetto","year":"2016","journal-title":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems"},{"issue":"1","key":"2026032712274198800_ref090","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/2796314.2745850","article-title":"Transient and steady-state regime of a family of list-based cache replacement algorithms","volume":"43","author":"Gast","year":"2015","journal-title":"ACMSIGMETRICS Performance Evaluation Review"},{"key":"2026032712274198800_ref091","first-page":"82","article-title":"Lagrangian relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathematical Studies"},{"key":"2026032712274198800_ref092","first-page":"1","article-title":"Regret minimization for online buffering problems using the weighted majority algorithm","volume-title":"Proceedings of the 33rd Annual Conference on Learning Theory (COLT)","author":"Geulen","year":"2010"},{"key":"2026032712274198800_ref093","first-page":"1","article-title":"Show me the cache: Optimizing cache-friendly recommendations for sequential content access","author":"Giannakas","year":"2018","journal-title":"Proceedings of the IEEE Symposium on \u201cA World of Wireless, Mobile and Multimedia Networks\u201d (WoWMoM)"},{"key":"2026032712274198800_ref094","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1298306.1298310","article-title":"Youtube traffic characterization: A view from the edge","volume-title":"Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement","author":"Gill","year":"2007"},{"key":"2026032712274198800_ref095","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/2896377.2901483","article-title":"Spatial multi-LRU: Distributed caching for wireless networks with coverage overlaps","volume-title":"Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science","author":"Giovanidis","year":"2016"},{"key":"2026032712274198800_ref096","first-page":"126","article-title":"Asymptotic laws for content replication and delivery in wireless networks","volume-title":"Proceedings of the 2012 IEEE INFOCOM Conference on Computer Communications","author":"Gitzenis","year":"2012"},{"key":"2026032712274198800_ref097","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.comnet.2014.01.012","article-title":"Enhancing wireless networks with caching: Asymptotic laws, sustainability&tradeoffs","volume":"64","author":"Gitzenis","year":"2014","journal-title":"Computer Networks"},{"issue":"5","key":"2026032712274198800_ref098","doi-asserted-by":"crossref","first-page":"2760","DOI":"10.1109\/TIT.2012.2235905","article-title":"Asymptotic laws for joint content replication and delivery in wireless networks","volume":"59","author":"Gitzenis","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712274198800_ref099","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/QSHINE.2014.6928681","article-title":"Efficient file replication in large wireless networks with dynamic popularity","volume-title":"10th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness","author":"Gitzenis","year":"2014"},{"issue":"2","key":"2026032712274198800_ref100","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1140\/epjb\/e2004-00316-5","article-title":"Problems with fitting to the power-law distribution","volume":"41","author":"Goldstein","year":"2004","journal-title":"The European Physical Journal B\u2014 Condensed Matter and Complex Systems"},{"issue":"4","key":"2026032712274198800_ref101","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/MCOM.2013.6495773","article-title":"Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution","volume":"51","author":"Golrezaei","year":"2013","journal-title":"IEEE Communications Magazine"},{"issue":"12","key":"2026032712274198800_ref102","doi-asserted-by":"crossref","first-page":"8402","DOI":"10.1109\/TIT.2013.2281606","article-title":"FemtoCaching: Wireless content delivery through distributed caching helpers","volume":"59","author":"Golrezaei","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712274198800_ref103","first-page":"1107","article-title":"Femtocaching: Wireless video content delivery through distributed caching helpers","volume-title":"Proceedings of the 2012 IEEE INFOCOM Conference on Computer Communication","author":"Golrezaei","year":"2012"},{"key":"2026032712274198800_ref104","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jagm.1998.0993","article-title":"Greedy strikes back: Improved facility location algorithms","volume":"31","author":"Guha","year":"1999","journal-title":"Journal of Algorithms"},{"key":"2026032712274198800_ref105","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/SFCS.2000.892328","article-title":"Hierarchical placement and network design problems","author":"Guha","year":"2000","journal-title":"Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS)"},{"key":"2026032712274198800_ref106","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/380752.380830","article-title":"Provisioning a virtual private network: A network design problem for multicommodity flow","author":"Gupta","year":"2001","journal-title":"Proceedings of the ACM STOC"},{"key":"2026032712274198800_ref107","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/780542.780597","article-title":"Simple and better approximation algorithms for network design","author":"Gupta","year":"2003","journal-title":"Proceedings of the ACM STOC"},{"key":"2026032712274198800_ref108","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","article-title":"The capacity of wireless networks","volume":"46","author":"Gupta","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712274198800_ref109","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.comnet.2017.04.044","article-title":"Performance evaluation for new web caching strategies combining LRU with score based object selection","volume":"125","author":"Hasslinger","year":"2017","journal-title":"Computer Networks"},{"key":"2026032712274198800_ref110","doi-asserted-by":"crossref","unstructured":"Hazan\n              E.\n            \n           (2006). \u201cEfficient algorithms for online convex optimization and their applications\u201d. PhD Thesis. Princeton University.","DOI":"10.1007\/11776420_37"},{"issue":"3\u20144","key":"2026032712274198800_ref111","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1561\/2400000013","article-title":"Introduction to online convex optimization","volume":"2","author":"Hazan","year":"2016","journal-title":"Foundations and Trends in Optimization"},{"issue":"6","key":"2026032712274198800_ref112","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1109\/TNET.2008.918081","article-title":"Traffic modeling and proportional partial caching for peer-to-peer systems","volume":"16","author":"Hefeeda","year":"2008","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"4","key":"2026032712274198800_ref113","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1740-9713.2012.00584.x","article-title":"How much information is there in the \u2018information society\u2019?","volume":"9","author":"Hilbert","year":"2012","journal-title":"Significance"},{"issue":"2","key":"2026032712274198800_ref114","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","article-title":"A best possible heuristic for the k-center problem","volume":"10","author":"Hochbaum","year":"1985","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2026032712274198800_ref115","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for bottleneck problems","volume":"33","author":"Hochbaum","year":"1986","journal-title":"Journal of the ACM"},{"key":"2026032712274198800_ref116","first-page":"167","article-title":"An analysis of Facebook photo caching","author":"Huang","year":"2013","journal-title":"Proceedings of ACM Symposium on Operating Systems Principles"},{"key":"2026032712274198800_ref117","first-page":"57","article-title":"Analyzing cacheable traffic in ISP access networks for micro CDN applications via content-centric networking","volume-title":"Proceedings of the 1st International Conference on Information-Centric Networking","author":"Imbrenda","year":"2014"},{"key":"2026032712274198800_ref118","first-page":"77","article-title":"Adaptive caching networks with optimality guarantees","author":"Ioannidis","year":"2016","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems (SIGMETRICS)"},{"key":"2026032712274198800_ref119","first-page":"77","article-title":"Jointly optimal routing and caching for arbitrary network topologies","author":"Ioannidis","year":"2017","journal-title":"Proceedings of the IEEE ICN"},{"issue":"6","key":"2026032712274198800_ref120","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/JSAC.2018.2844981","article-title":"Jointly optimal routing and caching for arbitrary network topologies","volume":"36","author":"Ioannidis","year":"2018","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"2026032712274198800_ref121","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/TNET.2016.2633370","article-title":"Distributed storage control algorithms for dynamic networks","volume":"25","author":"Iosifidis","year":"2017","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"2026032712274198800_ref122","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1145\/950620.950621","article-title":"Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP","volume":"50","author":"Jain","year":"2003","journal-title":"Journal of the ACM"},{"key":"2026032712274198800_ref123","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1145\/375827.375845","article-title":"Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation","volume":"48","author":"Jain","year":"2001","journal-title":"Journal of the ACM"},{"key":"2026032712274198800_ref124","first-page":"731","article-title":"A new greedy approach for facility location problems","author":"Jain","year":"2002","journal-title":"Proceedings of the 29th ACM Symposium on Theory of Computing (STOC)"},{"key":"2026032712274198800_ref125","first-page":"295","article-title":"On the placement of internet instrumentation","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Jamin","year":"2000"},{"issue":"2","key":"2026032712274198800_ref126","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1214\/aoap\/1029962750","article-title":"Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities","volume":"9","author":"Jelenkovic","year":"1999","journal-title":"The Annals of Applied Probability"},{"issue":"1","key":"2026032712274198800_ref127","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/JSAC.2015.2452672","article-title":"Wireless device-to-device caching networks: Basic principles and system performance","volume":"34","author":"Ji","year":"2016","journal-title":"IEEE Journal on Selected Areas in Communication"},{"issue":"2","key":"2026032712274198800_ref128","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1109\/TIT.2015.2504556","article-title":"Fundamental limits of caching in wireless D2D networks","volume":"62","author":"Ji","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"2026032712274198800_ref129","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TPDS.2005.94","article-title":"On optimal replication of data object at hierarchical and transparent web proxies","volume":"16","author":"Jia","year":"2005","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2026032712274198800_ref130","first-page":"417","article-title":"Modeling TTL-based internet caches","volume":"1","author":"Jung","year":"2003","journal-title":"Proceedings of IEEE INFOCOM"},{"issue":"2","key":"2026032712274198800_ref131","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.jvcir.2009.06.007","article-title":"Understanding internet video sharing site workload: A view from data center design","volume":"21","author":"Kang","year":"2010","journal-title":"Journal of Visual Communication and Image Representation"},{"issue":"4","key":"2026032712274198800_ref132","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0140-3664(01)00409-1","article-title":"Object replication strategies in content distribution networks","volume":"25","author":"Kangasharju","year":"2002","journal-title":"Computer Communications"},{"key":"2026032712274198800_ref133","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-30162-4","volume-title":"Encyclopedia of Algorithms","author":"Kao","year":"2008"},{"key":"2026032712274198800_ref134","first-page":"19","article-title":"CABaRet: Leveraging recommendation systems for mobile edge caching","author":"Kastanakis","year":"2018","journal-title":"Proceedings of the Workshop on Mobile Edge Communications (MECOMM)"},{"issue":"July","key":"2026032712274198800_ref135","first-page":"163","article-title":"Optimal web cache sizing: Scalable methods for exact solutions","volume":"24","author":"Kelly","year":"2000","journal-title":"Computer Communications"},{"key":"2026032712274198800_ref136","article-title":"Analysis of demand paging algorithms","author":"King III","year":"1971","journal-title":"IFIP Congress"},{"issue":"1","key":"2026032712274198800_ref137","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1006\/jagm.2000.1129","article-title":"Placement algorithms for hierarchical cooperative caching","volume":"38","author":"Korupolu","year":"2001","journal-title":"Journal of Algorithms"},{"issue":"11","key":"2026032712274198800_ref138","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1016\/j.comnet.2005.07.009","article-title":"On the universality of rank distributions of website popularity","volume":"50","author":"Krashakov","year":"2006","journal-title":"Computer Networks"},{"key":"2026032712274198800_ref139","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/90.879344","article-title":"The cache location problem","volume":"8","author":"Krishnan","year":"2000","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"36","key":"2026032712274198800_ref140","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/JSAC.2018.2844986","article-title":"A decomposition framework for optimal edge-cache leasing","volume":"6","author":"Krolikowski","year":"2018","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032712274198800_ref141","first-page":"74","article-title":"Inter-datacenter bulk transfers with Netstitcher","volume-title":"ACM SIGCOMM","author":"Laoutaris","year":"2011"},{"key":"2026032712274198800_ref142","first-page":"2144","article-title":"Distributed placement of service facilities in large-scale networks","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Laoutaris","year":"2007"},{"key":"2026032712274198800_ref143","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.comnet.2004.07.020","article-title":"On the optimization of storage capacity allocation for content distribution","volume":"47","author":"Laoutaris","year":"2005","journal-title":"Computer Networks"},{"key":"2026032712274198800_ref144","first-page":"1","article-title":"Placing dynamic content in caches with small population","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Leconte","year":"2016"},{"issue":"2","key":"2026032712274198800_ref145","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ipl.2015.09.004","article-title":"A simple proof of optimality for the MIN cache replacement policy","volume":"116","author":"Lee","year":"2015","journal-title":"Information Processing Letters"},{"issue":"11","key":"2026032712274198800_ref146","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1109\/71.250099","article-title":"Replication algorithms in a remote caching architecture","volume":"4","author":"Leff","year":"1993","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2026032712274198800_ref147","first-page":"1","article-title":"Reconstruction in the labeled stochastic block model","author":"Lelarge","year":"2013","journal-title":"IEEE Information Theory Workshop (ITW)"},{"issue":"6","key":"2026032712274198800_ref148","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1109\/JSAC.2018.2844982","article-title":"Implicit coordination of caches in small cell networks under unknown popularity profiles","volume":"36","author":"Leonardi","year":"2018","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032712274198800_ref149","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0380-8","article-title":"LP-based approximation algorithms for capacitated facility location","volume":"131","author":"Levi","year":"2012","journal-title":"Math. Program."},{"key":"2026032712274198800_ref150","first-page":"1282","article-title":"On the optimal placement of web proxies in the internet","author":"Li","year":"1999","journal-title":"IEEE INFOCOM"},{"issue":"6","key":"2026032712274198800_ref151","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1109\/JSAC.2018.2844984","article-title":"Accurate learning or fast mixing? dynamic adaptability of caching algorithms","volume":"36","author":"Li","year":"2018","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"2026032712274198800_ref152","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1145\/1084772.1084774","article-title":"Optimal methods for coordinated enroute web caching for tree networks","volume":"5","author":"Li","year":"2005","journal-title":"ACM Transactions on Internet Technology"},{"key":"2026032712274198800_ref153","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","article-title":"A 1.488 approximation algorithm for the uncapacitated facility location problem","volume":"31","author":"Li","year":"2013","journal-title":"Information and Computation"},{"issue":"1","key":"2026032712274198800_ref154","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TIT.2017.2756959","article-title":"A fundamental tradeoff between computation and communication in distributed computing","volume":"64","author":"Li","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712274198800_ref155","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1145\/2488608.2488723","article-title":"Approximating k-median via pseudo-approximation","author":"Li","year":"2013","journal-title":"Proceedings of the 45th ACM Symposium on Theory of Computing (STOC)"},{"issue":"12","key":"2026032712274198800_ref156","doi-asserted-by":"crossref","first-page":"2503","DOI":"10.1109\/TMM.2016.2596042","article-title":"Trend-aware video caching through online learning","volume":"18","author":"Li","year":"2016","journal-title":"IEEE Transactions on Multimedia"},{"issue":"15","key":"2026032712274198800_ref157","doi-asserted-by":"crossref","first-page":"1834","DOI":"10.1016\/j.comcom.2010.06.002","article-title":"Analysis and performance study for coordinated hierarchical cache placement strategies","volume":"33","author":"Li","year":"2010","journal-title":"Computer Communications"},{"key":"2026032712274198800_ref158","first-page":"1","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML)","author":"Liakopoulos","year":"2019"},{"key":"2026032712274198800_ref159","first-page":"267","article-title":"Disaggregated memory for expansion and sharing in blade servers","author":"Lim","year":"2009","journal-title":"Proceedings of the 36th Annual International Symposium on Computer Architecture (ISCA)"},{"issue":"3","key":"2026032712274198800_ref160","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1109\/TWC.2015.2494579","article-title":"Asymptotic scaling laws of wireless ad hoc network with physical layer caching","volume":"15","author":"Liu","year":"2016","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"2026032712274198800_ref161","first-page":"1","article-title":"Competitive caching with machine learning advice","volume-title":"Proceedings of the 35th International Conference on Machine Learning (ICML)","author":"Lykouris","year":"2018"},{"key":"2026032712274198800_ref162","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1023\/A:1023997605430","article-title":"An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in Rn","volume":"117","author":"Maculan","year":"2003","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"5","key":"2026032712274198800_ref163","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental limits of caching","volume":"60","author":"Maddah-Ali","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712274198800_ref164","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.comcom.2017.11.015","article-title":"Adapting caching to audience retention rate","volume":"116","author":"Maggi","year":"2018","journal-title":"Computer Communications"},{"issue":"3","key":"2026032712274198800_ref165","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/65.844496","article-title":"Traffic analysis of a web proxy caching hierarchy","volume":"14","author":"Mahanti","year":"2000","journal-title":"IEEE Network"},{"key":"2026032712274198800_ref166","volume-title":"Foundations of Statistical Natural Language Processing","author":"Manning","year":"1999"},{"key":"2026032712274198800_ref167","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"Maskin","year":"1990"},{"issue":"2","key":"2026032712274198800_ref168","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","article-title":"Evaluation techniques for storage hierarchies","volume":"9","author":"Mattson","year":"1970","journal-title":"IBM Systems Journal"},{"key":"2026032712274198800_ref169","first-page":"115","article-title":"ARC: A self-tuning, low overhead replacement cache","volume-title":"Proceedings of the 2nd Usenix Conference on File and Storage Technologies (FAST\u201903)","author":"Megiddo","year":"2003"},{"key":"2026032712274198800_ref170","first-page":"65","article-title":"Ranking web sites with real user traffic","volume-title":"Proceedings of the 1st ACM International Conference on Web Search and Data Mining (WSDM)","author":"Meiss","year":"2008"},{"key":"2026032712274198800_ref171","volume-title":"Discrete Location Theory","author":"Mirchandani","year":"1990"},{"issue":"2","key":"2026032712274198800_ref172","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1080\/15427951.2004.10129088","article-title":"A brief history of generative models for power law and lognormal distributions","volume":"1","author":"Mitzenmacher","year":"2004","journal-title":"Internet Mathematics"},{"issue":"5","key":"2026032712274198800_ref173","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/90.879343","article-title":"Fair end-to-end window-based congestion control","volume":"8","author":"Mo","year":"2000","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref174","first-page":"387","article-title":"The fundamentals of heavy-tails: properties, emergence, and identification","volume-title":"ACM SIGMETRICS Performance Evaluation Review","author":"Nair","year":"2013"},{"key":"2026032712274198800_ref175","first-page":"37","article-title":"On the interaction between content caching and request assignment in cellular cache networks","author":"Naveen","year":"2015","journal-title":"Proceedings of the 5th Workshop on All Things Cellular (ATC)"},{"issue":"4","key":"2026032712274198800_ref176","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1137\/070708111","article-title":"Approximate primal solutions and rate analysis for dual subgradient methods","volume":"19","author":"Nedic","year":"2009","journal-title":"SIAM Journal on Optimization"},{"key":"2026032712274198800_ref177","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"issue":"1","key":"2026032712274198800_ref178","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Mathematical Programming"},{"issue":"Sept.","key":"2026032712274198800_ref179","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00107510500052444","article-title":"Power laws, Pareto distributions and Zipf\u2019s law","volume":"46","author":"Newman","year":"2005","journal-title":"Contemporary Physics"},{"key":"2026032712274198800_ref180","first-page":"2111","article-title":"Caching in wireless networks","volume-title":"Proceedings IEEE International Symposium on Information Theory","author":"Niesen","year":"2009"},{"issue":"3","key":"2026032712274198800_ref181","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1842733.1842736","article-title":"The Akamai network: A platform for high-performance Internet applications","volume":"44","author":"Nygren","year":"2010","journal-title":"SIGOPS Operating Systems Review"},{"key":"2026032712274198800_ref182","first-page":"1","article-title":"Catalog dynamics: Impact of content publishing and perishing on the performance of a LRU cache","author":"Olmos","year":"2014","journal-title":"26th International Teletraffic Congress (ITC), 2014"},{"issue":"9","key":"2026032712274198800_ref183","article-title":"An inverse problem approach for content popularity estimation","volume":"3","author":"Olmos","year":"2015","journal-title":"EAI Endorsed Trans. Scalable Inf. Syst."},{"issue":"1","key":"2026032712274198800_ref184","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/300515.300518","article-title":"An optimality proof of the LRU-K page replacement algorithm","volume":"46","author":"O\u2019Neil","year":"1999","journal-title":"Journal of the ACM (JACM)"},{"key":"2026032712274198800_ref185","first-page":"313","article-title":"Distributed algorithms for content caching in mobile Backhaul networks","author":"Pacifici","year":"2016","journal-title":"Proceedings of International Teletraffic Congress"},{"issue":"4","key":"2026032712274198800_ref186","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/347057.347413","article-title":"The content and access dynamics of a busy web site: Findings and implications","volume":"30","author":"Padmanabhan","year":"2000","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"2026032712274198800_ref187","unstructured":"Pappas\n              S.\n            \n           (2016). \u201cHow big is the Internet, really?\u201d. Live Science. url: https:\/\/www.livescience.com\/54094-how-big-is-the-internet.html."},{"key":"2026032712274198800_ref188","first-page":"1","article-title":"Learning to cooperate in D2D caching networks","author":"Paschos","year":"2019","journal-title":"Proceedings of the IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)"},{"issue":"2","key":"2026032712274198800_ref189","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1109\/TNET.2020.2968424","article-title":"Online convex optimization for caching networks","volume":"28","author":"Paschos","year":"2020","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref190","first-page":"235","article-title":"Learning to cache with no regret","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Paschos","year":"2019"},{"issue":"8","key":"2026032712274198800_ref191","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MCOM.2016.7537172","article-title":"Wireless caching: Technical misconceptions and business barriers","volume":"54","author":"Paschos","year":"2016","journal-title":"IEEE Communications Magazine"},{"key":"2026032712274198800_ref192","first-page":"355","article-title":"The effect of caching in sustainability of large wireless networks","author":"Paschos","year":"2012","journal-title":"Proceedings of the 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2012)"},{"issue":"6","key":"2026032712274198800_ref193","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/JSAC.2018.2844939","article-title":"The role of caching in future communication systems and networks","volume":"36","author":"Paschos","year":"2018","journal-title":"IEEE Journal on Selected Areas of Communication (Editorial)"},{"key":"2026032712274198800_ref194","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.3758\/s13423-014-0585-6","article-title":"Zipf\u2019s word frequency law in natural language: A critical review and future directions","volume":"21","author":"Piantadosi","year":"2014","journal-title":"Psychonomic Bulletin and Review"},{"key":"2026032712274198800_ref195","first-page":"1078","article-title":"Video delivery over heterogeneous cellular networks: Optimizing cost and performance","author":"Poularakis","year":"2014","journal-title":"Proceedings of IEEE INFOCOM"},{"issue":"11","key":"2026032712274198800_ref196","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TNSM.2016.2521352","article-title":"Mobile data offloading through caching in residential 802.11 wireless networks","volume":"13","author":"Poularakis","year":"2016","journal-title":"IEEE Transactions on Network and Service Management"},{"issue":"4","key":"2026032712274198800_ref197","doi-asserted-by":"crossref","first-page":"2995","DOI":"10.1109\/TWC.2016.2514418","article-title":"Exploiting caching and multicast for 5G wireless networks","volume":"15","author":"Poularakis","year":"2016","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"2026032712274198800_ref198","first-page":"1","article-title":"Optimal cooperative content placement algorithms in hierarchical cache topologies","volume-title":"Proceedings of the 46th Annual IEEE Conference on Information Sciences and Systems (CISS)","author":"Poularakis","year":"2012"},{"issue":"10","key":"2026032712274198800_ref199","doi-asserted-by":"crossref","first-page":"3665","DOI":"10.1109\/TCOMM.2014.2351796","article-title":"Approximation algorithms for mobile data caching in small cell networks","volume":"62","author":"Poularakis","year":"2014","journal-title":"IEEE Transactions on Communications"},{"issue":"5","key":"2026032712274198800_ref200","doi-asserted-by":"crossref","first-page":"2092","DOI":"10.1109\/TCOMM.2016.2545655","article-title":"On the complexity of optimal content placement in hierarchical caching networks","volume":"64","author":"Poularakis","year":"2016","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712274198800_ref201","first-page":"1587","article-title":"On the placement of web server replicas","volume-title":"IEEE INFOCOM","author":"Qiu","year":"2001"},{"issue":"3","key":"2026032712274198800_ref202","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The benders decomposition algorithm: A literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"2026032712274198800_ref203","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-1-4612-0919-5_16","article-title":"Information and the accuracy attainable in the estimation of statistical parameters","author":"Rao","year":"1992","journal-title":"Breakthroughs in Statistics"},{"key":"2026032712274198800_ref204","first-page":"92","article-title":"Update aware replica placement","volume-title":"Proceedings of the 9th IEEE International Conference on Network and Service Management (CNSM)","author":"Rappaport","year":"2013"},{"issue":"4","key":"2026032712274198800_ref205","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/346000.346014","article-title":"File popularity characterisation","volume":"27","author":"Roadknight","year":"2000","journal-title":"ACM Sigmetrics Performance Evaluation Review"},{"key":"2026032712274198800_ref206","first-page":"1","article-title":"Exploring the memory-bandwidth tradeoff in an information-centric network","author":"Roberts","year":"2013","journal-title":"Proceedings of the 25th IEEE International Teletraffic Congress (ITC)"},{"issue":"10","key":"2026032712274198800_ref207","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TPDS.2006.145","article-title":"Replicated server placement with QoS constraints","volume":"17","author":"Rodolakis","year":"2017","journal-title":"IEEE Transactions on Parallel Distributed Systems"},{"issue":"4","key":"2026032712274198800_ref208","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/90.944339","article-title":"Analysis of web caching architectures hierarchical and distributed caching","volume":"9","author":"Rodriguez","year":"2001","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2\u20143","key":"2026032712274198800_ref209","first-page":"72","article-title":"A short proof of optimality for the MIN cache replacement algorithm","volume":"102","author":"Roy","year":"2007","journal-title":"Information Processing Letters"},{"key":"2026032712274198800_ref210","first-page":"2366","article-title":"FluidRAN: Optimized vRAN\/MEC orchestration","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Saavedra","year":"2019"},{"issue":"1","key":"2026032712274198800_ref211","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/JSTSP.2017.2787979","article-title":"Optimal and scalable caching for 5G using reinforcement learning of space-time popularities","volume":"12","author":"Sadeghi","year":"2018","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"2","key":"2026032712274198800_ref212","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1109\/COMST.2016.2626384","article-title":"A survey on replica server placement algorithms for content delivery networks","volume":"19","author":"Sahoo","year":"2017","journal-title":"IEEE Communications Surveys and Tutorials"},{"key":"2026032712274198800_ref213","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1145\/1963405.1963471","article-title":"Track globally, deliver locally: Improving content delivery networks by tracking geographic social cascades","volume-title":"Proceedings of the 20th International Conference on World Wide Web","author":"Scellato","year":"2011"},{"key":"2026032712274198800_ref214","first-page":"456","article-title":"Optimizing costly functions with simple constraints: A limited memory projected quasi-Newton algorithm","volume-title":"Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS)","author":"Schmidt","year":"2009"},{"key":"2026032712274198800_ref215","volume-title":"Online Learning and Online Convex Optimization","author":"Shalev-Shwartz","year":"2012"},{"key":"2026032712274198800_ref216","first-page":"1088","article-title":"Facility location with service installation costs","author":"Shmoys","year":"2004","journal-title":"Proceedings of the 15th ACM SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"2026032712274198800_ref217","first-page":"265","article-title":"Approximation algorithms for facility location problems","volume-title":"Proceedings of the 29th ACM Symposium on Theory of Computing (STOC)","author":"Shmoys","year":"1997"},{"key":"2026032712274198800_ref218","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2670518.2673876","article-title":"The internet at the speed of light","volume-title":"Proceedings of the 13th ACM Workshop on Hot Topics in Networks","author":"Singla","year":"2014"},{"issue":"2","key":"2026032712274198800_ref219","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Communications of the ACM"},{"issue":"6","key":"2026032712274198800_ref220","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1109\/JSAC.2018.2844985","article-title":"A reinforcement-learning approach to proactive caching in wireless networks","volume":"36","author":"Somuyiwa","year":"2018","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"18","key":"2026032712274198800_ref221","doi-asserted-by":"crossref","first-page":"4021","DOI":"10.1016\/j.comnet.2011.07.023","article-title":"Storage planning and replica assignment in content-centric publish\/subscribe networks","volume":"55","author":"Sourlas","year":"2011","journal-title":"Computer Networks"},{"issue":"2\u20143","key":"2026032712274198800_ref222","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-5316(01)00045-1","article-title":"Probabilistic methods for web caching","volume":"46","author":"Starobinski","year":"2001","journal-title":"Performance Evaluation"},{"key":"2026032712274198800_ref223","first-page":"1563","article-title":"Efficient Euclidean projections onto the intersection of norm balls","volume-title":"Proceedings of the 29th International Conference on Machine Learning (ICML)","author":"Su","year":"2012"},{"issue":"4","key":"2026032712274198800_ref224","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/s00453-004-1112-3","article-title":"Primal-dual algorithms for connected facility location problems","volume":"40","author":"Swamy","year":"2004","journal-title":"Algorithmica"},{"key":"2026032712274198800_ref225","volume-title":"Modern Operating System","author":"Tanenbaum","year":"2009"},{"key":"2026032712274198800_ref226","first-page":"304","article-title":"ModelGraft: Accurate, scalable, and flexible performance evaluation of general cache networks","volume":"01","author":"Tortelli","year":"2016","journal-title":"Proceedings of the 28th International Teletraffic Congress"},{"issue":"4","key":"2026032712274198800_ref227","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MNET.2017.1600307","article-title":"Cooperative hierarchical caching in 5G cloud radio access networks","volume":"31","author":"Tran","year":"2017","journal-title":"IEEE Network"},{"issue":"5","key":"2026032712274198800_ref228","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2541468.2541470","article-title":"Temporal locality in today\u2019s content caching: Why it matters and how to model it","volume":"43","author":"Traverso","year":"2013","journal-title":"ACM Computer Communication Review"},{"key":"2026032712274198800_ref229","first-page":"1","article-title":"Optimal cache allocation for femto helpers with joint transmission capabilities","volume-title":"Proceedings of the IEEE International Conference on Communications","author":"Tuholukova","year":"2017"},{"issue":"11","key":"2026032712274198800_ref230","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1016\/j.comnet.2009.02.019","article-title":"Wikipedia workload analysis for decentralized hosting","volume":"53","author":"Urdaneta","year":"2009","journal-title":"Computer Networks"},{"key":"2026032712274198800_ref231","first-page":"2885","article-title":"Online convex optimization with perturbed constraints: Optimal rates against stronger benchmarks","volume-title":"Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS)","author":"Valls","year":"2020"},{"issue":"1","key":"2026032712274198800_ref232","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TAC.2018.2867536","article-title":"A convex optimization approach to discrete optimal control","volume":"64","author":"Valls","year":"2019","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026032712274198800_ref233","first-page":"16","article-title":"On the scale and performance of cooperative web proxy caching","volume-title":"Proceedings of the 17th ACM Symposium on Operating System Principles (SOSP)","author":"Voelker","year":"1999"},{"issue":"5","key":"2026032712274198800_ref234","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ipl.2007.12.001","article-title":"Another short proof of optimality for the MIN cache replacement algorithm","volume":"106","author":"Vogler","year":"2008","journal-title":"Information Processing Letters"},{"issue":"4","key":"2026032712274198800_ref235","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Statistics and Computing"},{"key":"2026032712274198800_ref236","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.comcom.2014.12.009","article-title":"Optimal chunking and partial caching in information-centric networks","volume":"61","author":"Wang","year":"2015","journal-title":"Computer Communications"},{"issue":"3","key":"2026032712274198800_ref237","doi-asserted-by":"crossref","first-page":"1977","DOI":"10.1137\/16M1068207","article-title":"Vanishing price of anarchy in large coordinate nonconvex optimization","volume":"27","author":"Wang","year":"2017","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"2026032712274198800_ref238","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TNET.2011.2150761","article-title":"Cost of not splitting in routing: Characterization and estimation","volume":"19","author":"Wang","year":"2011","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712274198800_ref239","article-title":"Projection onto the capped simplex","author":"Wang","year":"2015"},{"issue":"6","key":"2026032712274198800_ref240","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/ett.1011","article-title":"Cache replacement policies for P2P file sharing protocols","volume":"15","author":"Wierzbicki","year":"2004","journal-title":"Transactions on Emerging Telecommunications Technologies"},{"key":"2026032712274198800_ref241","unstructured":"Wikipedia statistics\n            \n           (n.d.). \u201cTop-1000 request statistics for English Wikipedia pages\u201d. url: https:\/\/wikitech.wikimedia.org\/wiki\/Pageviews_API."},{"key":"2026032712274198800_ref242","first-page":"319","article-title":"Comparison of caching strategies in modern cellular Backhaul networks","volume-title":"Proceeding of the 11th ACM Annual International Conference on Mobile Systems, Applications, and Services (MobiSys)","author":"Woo","year":"2013"},{"key":"2026032712274198800_ref243","first-page":"2546","article-title":"Tecc: Towards collaborative in-network caching guided by traffic engineering","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)","author":"Xie","year":"2012"},{"key":"2026032712274198800_ref244","first-page":"240","article-title":"A Zipf-like distribution of popularity and hits in the mobile web pages with short life time","volume-title":"Proceedings of Parallel and Distributed Computing, Applications and Technologies, PDCAT \u201906","author":"Yamakami","year":"2006"},{"issue":"6","key":"2026032712274198800_ref245","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/BF01189992","article-title":"The k-server dual and loose competitiveness for paging","volume":"11","author":"Young","year":"1994","journal-title":"Algorithmica"},{"issue":"3","key":"2026032712274198800_ref246","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00453-001-0124-5","article-title":"On-line file caching","volume":"33","author":"Young","year":"2002","journal-title":"Algorithmica"},{"issue":"4","key":"2026032712274198800_ref247","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/1218063.1217968","article-title":"Understanding user behavior in large-scale video-on-demand systems","volume":"40","author":"Yu","year":"2006","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"2","key":"2026032712274198800_ref248","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.1040.0125","article-title":"A multiexchange local search algorithm for the capacitated facility location problem","volume":"30","author":"Zhang","year":"2005","journal-title":"Mathematics of Operations Research"},{"key":"2026032712274198800_ref249","first-page":"1","article-title":"Characterizing files in the modern Gnutella network: A measurement study","author":"Zhao","year":"2006","journal-title":"Proceedings of SPIE 6071, Multimedia Computing and Networking"},{"issue":"8","key":"2026032712274198800_ref250","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1109\/JSAC.2018.2844919","article-title":"ReD\/LeD: An asymptotically optimal and scalable online algorithm for service caching at the edge","volume":"36","author":"Zhao","year":"2018","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"2026032712274198800_ref251","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.comnet.2008.09.022","article-title":"Characteristics of YouTube network traffic at a campus network\u2014 Measurements, models, and implications","volume":"53","author":"Zink","year":"2009","journal-title":"Computer Networks"},{"key":"2026032712274198800_ref252","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML)","author":"Zinkevich","year":"2003"},{"key":"2026032712274198800_ref253","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-319-19638-1_12","article-title":"Analysis of web objects distribution","volume-title":"Distributed Computing and Artificial Intelligence, 12th International Conference","author":"Zotano","year":"2015"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/16\/3-4\/156\/11153401\/0100000104en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/16\/3-4\/156\/11153401\/0100000104en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:35Z","timestamp":1777471835000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/16\/3-4\/156\/1332364\/Cache-Optimization-Models-and-Algorithms"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":253,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,8,20]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000104","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,20]]}}}