{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:48:33Z","timestamp":1762508913991,"version":"3.41.0"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US-India NSF-DST collaborative research"},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["101017109"],"award-info":[{"award-number":["101017109"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:p>We take a systematic look at the problem of storing whole files in a cache with limited capacity in the context of optimistic learning, where the caching policy has access to a prediction oracle (provided by, e.g., a Neural Network). The successive file requests are assumed to be generated by an adversary, and no assumption is made on the accuracy of the oracle. In this setting, we provide a universal lower bound for prediction-assisted online caching and proceed to design a suite of policies with a range of performance-complexity trade-offs. All proposed policies offer sublinear regret bounds commensurate with the accuracy of the oracle. Our results substantially improve upon all recently-proposed online caching policies, which, being unable to exploit the oracle predictions, offer only O(\u221aT) regret. In this pursuit, we design, to the best of our knowledge, the first comprehensive optimistic Follow-the-Perturbed leader policy, which generalizes beyond the caching problem. We also study the problem of caching files with different sizes and the bipartite network caching problem. Finally, we evaluate the efficacy of the proposed policies through extensive numerical experiments using real-world traces.<\/jats:p>","DOI":"10.1145\/3570608","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:20:10Z","timestamp":1670530810000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Optimistic No-regret Algorithms for Discrete Caching"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0211-2666","authenticated-orcid":false,"given":"Naram","family":"Mhaisen","sequence":"first","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7220-0691","authenticated-orcid":false,"given":"Abhishek","family":"Sinha","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5922-1612","authenticated-orcid":false,"given":"Georgios","family":"Paschos","sequence":"additional","affiliation":[{"name":"Amazon, Luxembourg, Luxembourg"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1001-2323","authenticated-orcid":false,"given":"George","family":"Iosifidis","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Giovanidis and A. Avranas. 2016. Spatial Multi-LRU: Distributed Caching for Wireless Networks with Coverage Overlaps. arXiv:1612.04363 (2016).  A. Giovanidis and A. Avranas. 2016. Spatial Multi-LRU: Distributed Caching for Wireless Networks with Coverage Overlaps. arXiv:1612.04363 (2016).","DOI":"10.1145\/2896377.2901483"},{"key":"e_1_2_1_2_1","volume-title":"Proc. of COLT.","author":"Abernethy Jacob","year":"2014","unstructured":"Jacob Abernethy , Chansoo Lee , Abhinav Sinha , and Ambuj Tewari . 2014 . Online Linear Optimization via Smoothing . In Proc. of COLT. Jacob Abernethy, Chansoo Lee, Abhinav Sinha, and Ambuj Tewari. 2014. Online Linear Optimization via Smoothing. In Proc. of COLT."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365958"},{"key":"e_1_2_1_5_1","volume-title":"Lazy Lagrangians with Predictions for Online Learning. arXiv preprint arXiv:2201.02890","author":"Anderson Daron","year":"2022","unstructured":"Daron Anderson , George Iosifidis , and Douglas Leith . 2022. Lazy Lagrangians with Predictions for Online Learning. arXiv preprint arXiv:2201.02890 ( 2022 ). Daron Anderson, George Iosifidis, and Douglas Leith. 2022. Lazy Lagrangians with Predictions for Online Learning. arXiv preprint arXiv:2201.02890 (2022)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465533"},{"key":"e_1_2_1_7_1","volume-title":"Proc. of ICML.","author":"Antoniadis Antonios","year":"2020","unstructured":"Antonios Antoniadis , Christian Coester , Marek Elias , Adam Polak , and Bertrand Simon . 2020 . Online Metric Algorithms with Untrusted Predictions . In Proc. of ICML. Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, and Bertrand Simon. 2020. Online Metric Algorithms with Untrusted Predictions. In Proc. of ICML."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.013"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934819"},{"key":"e_1_2_1_10_1","volume-title":"Proc. of ICML.","author":"Bhaskara Aditya","year":"2020","unstructured":"Aditya Bhaskara , Ashok Cutkosky , Ravi Kumar , and Manish Purohit . 2020 a. Online Learning with Imperfect Hints . In Proc. of ICML. Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, and Manish Purohit. 2020a. Online Learning with Imperfect Hints. In Proc. of ICML."},{"volume-title":"Proc. of NeurIPS.","author":"Bhaskara A.","key":"e_1_2_1_11_1","unstructured":"A. Bhaskara , A. Cutkosky , R. Kumar , and M. Purohit . 2020b. Online Learning with Many Hints . In Proc. of NeurIPS. A. Bhaskara, A. Cutkosky, R. Kumar, and M. Purohit. 2020b. Online Learning with Many Hints. In Proc. of NeurIPS."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394189"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2981561"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2831690"},{"key":"e_1_2_1_15_1","volume-title":"Proc. of the ICML.","author":"Cohen Alon","year":"2015","unstructured":"Alon Cohen and Tamir Hazan . 2015 . Following the Perturbed Leader for Online Structured Learning . In Proc. of the ICML. Alon Cohen and Tamir Hazan. 2015. Following the Perturbed Leader for Online Structured Learning. In Proc. of the ICML."},{"key":"e_1_2_1_16_1","volume-title":"Regrets and Algorithms. Proc. ACM Meas. Anal. Comput. Syst.","volume":"1","author":"Comden J.","year":"2019","unstructured":"J. Comden , S. Yao , N. Chen , H. Xing , and Z. Liu . 2019. Online Optimization in Cloud Resource Provisioning: Predictions , Regrets and Algorithms. Proc. ACM Meas. Anal. Comput. Syst. , Vol. 1 , 3 ( 2019 ), 30 pages. J. Comden, S. Yao, N. Chen, H. Xing, and Z. Liu. 2019. Online Optimization in Cloud Resource Provisioning: Predictions, Regrets and Algorithms. Proc. ACM Meas. Anal. Comput. Syst. , Vol. 1, 3 (2019), 30 pages."},{"volume-title":"Introduction to algorithms","author":"Cormen Thomas H","key":"e_1_2_1_17_1","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2022. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2698164"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"e_1_2_1_20_1","first-page":"1281","article-title":"Follow the Leader If You Can, Hedge If You Must","volume":"15","author":"Rooij Steven De","year":"2014","unstructured":"Steven De Rooij , Tim Van Erven , Peter D. Gr\u00fcnwald , and Wouter M. Koolen . 2014 . Follow the Leader If You Can, Hedge If You Must . J. Mach. Learn. Res. , Vol. 15 , 1 (2014), 1281 -- 1316 . Steven De Rooij, Tim Van Erven, Peter D. Gr\u00fcnwald, and Wouter M. Koolen. 2014. Follow the Leader If You Can, Hedge If You Must. J. Mach. Learn. Res. , Vol. 15, 1 (2014), 1281--1316.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844982"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3142809"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830555"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3109727"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2843948"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390202"},{"key":"e_1_2_1_27_1","volume-title":"Proc. of NIPS.","author":"Gramacy Robert","year":"2002","unstructured":"Robert Gramacy , Manfred Warmuth , Scott Brandt , and Ismail Ari . 2002 . Adaptive Caching by Refetching . In Proc. of NIPS. Robert Gramacy, Manfred Warmuth, Scott Brandt, and Ismail Ari. 2002. Adaptive Caching by Refetching. In Proc. of NIPS."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6654887"},{"key":"e_1_2_1_29_1","article-title":"The MovieLens Datasets","volume":"5","author":"Maxwell Harper F.","year":"2015","unstructured":"F. Maxwell Harper and Joseph A. Konstan . 2015 . The MovieLens Datasets : History and Context. ACM Trans. Interact. Intell. Syst. , Vol. 5 , 4 (2015), 19 pages. F. Maxwell Harper and Joseph A. Konstan. 2015. The MovieLens Datasets: History and Context. ACM Trans. Interact. Intell. Syst. , Vol. 5, 4 (2015), 19 pages.","journal-title":"History and Context. ACM Trans. Interact. Intell. Syst."},{"key":"e_1_2_1_30_1","unstructured":"Elad Hazan. 2019. Introduction to Online Convex Optimization. https:\/\/arxiv.org\/abs\/1909.05207  Elad Hazan. 2019. Introduction to Online Convex Optimization. https:\/\/arxiv.org\/abs\/1909.05207"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088694"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453175.1453203"},{"key":"e_1_2_1_33_1","volume-title":"arXiv preprint arXiv:2205.04860","author":"Joshi Ativ","year":"2022","unstructured":"Ativ Joshi and Abhishek Sinha . 2022. Universal Caching . arXiv preprint arXiv:2205.04860 ( 2022 ). Ativ Joshi and Abhishek Sinha. 2022. Universal Caching. arXiv preprint arXiv:2205.04860 (2022)."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2869583"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/301464.301487"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491047"},{"key":"e_1_2_1_39_1","volume-title":"Proc. of ICML.","author":"Lykouris Thodoris","year":"2018","unstructured":"Thodoris Lykouris and Sergei Vassilvtiskii . 2018 . Competitive Caching with Machine Learned Advice . In Proc. of ICML. Thodoris Lykouris and Sergei Vassilvtiskii. 2018. Competitive Caching with Machine Learned Advice. In Proc. of ICML."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729988"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/98124"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3176834"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Naram Mhaisen George Iosifidis and Douglas Leith. 2022a. Online Caching with no Regret: Optimistic Learning via Recommendations. https:\/\/arxiv.org\/abs\/2204.09345  Naram Mhaisen George Iosifidis and Douglas Leith. 2022a. Online Caching with no Regret: Optimistic Learning via Recommendations. https:\/\/arxiv.org\/abs\/2204.09345","DOI":"10.23919\/IFIPNetworking55013.2022.9829806"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking55013.2022.9829806"},{"key":"e_1_2_1_46_1","volume-title":"Proc. of AISTATS.","author":"Mohri Mehryar","year":"2016","unstructured":"Mehryar Mohri and Scott Yang . 2016 . Accelerating Online Convex Optimization via Adaptive Prediction . In Proc. of AISTATS. Mehryar Mohri and Scott Yang. 2016. Accelerating Online Convex Optimization via Adaptive Prediction. In Proc. of AISTATS."},{"key":"e_1_2_1_47_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 342--365","author":"Mukhopadhyay Samrat","year":"2022","unstructured":"Samrat Mukhopadhyay , Sourav Sahoo , and Abhishek Sinha . 2022 . k-experts-Online Policies and Fundamental Limits . In International Conference on Artificial Intelligence and Statistics. PMLR, 342--365 . Samrat Mukhopadhyay, Sourav Sahoo, and Abhishek Sinha. 2022. k-experts-Online Policies and Fundamental Limits. In International Conference on Artificial Intelligence and Statistics. PMLR, 342--365."},{"key":"e_1_2_1_48_1","volume-title":"Proc. of NeurIPS.","author":"Dekel O.","year":"2017","unstructured":"O. Dekel . 2017 . Online Learning with a Hint . In Proc. of NeurIPS. et al. O. Dekel. 2017. Online Learning with a Hint. In Proc. of NeurIPS."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2014.6932936"},{"key":"e_1_2_1_50_1","unstructured":"Francesco Orabona. 2019. A Modern Introduction to Online Learning. https:\/\/arxiv.org\/abs\/1912.13213  Francesco Orabona. 2019. A Modern Introduction to Online Learning. https:\/\/arxiv.org\/abs\/1912.13213"},{"key":"e_1_2_1_51_1","volume-title":"Proc. of NeurIPS.","author":"Paria Debjit","year":"2021","unstructured":"Debjit Paria and Abhishek Sinha . 2021 . LeadCache: Regret-Optimal Caching in Networks . In Proc. of NeurIPS. Debjit Paria and Abhishek Sinha. 2021. LeadCache: Regret-Optimal Caching in Networks. In Proc. of NeurIPS."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1561\/0100000104"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2968424"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844939"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2351796"},{"key":"e_1_2_1_56_1","volume-title":"Proc. of NeurIPS.","author":"Rakhlin Alexander","year":"2013","unstructured":"Alexander Rakhlin and Karthik Sridharan . 2013 . Optimization, Learning, and Games with Predictable Sequences . In Proc. of NeurIPS. Alexander Rakhlin and Karthik Sridharan. 2013. Optimization, Learning, and Games with Predictable Sequences. In Proc. of NeurIPS."},{"key":"e_1_2_1_57_1","volume-title":"Proc. of USENIX Conferecne on File and Storage Technologies.","author":"Rodriguez Liana","year":"2021","unstructured":"Liana Rodriguez , Farzana Yusuf , Steven Lyons , Eysler Paz , and Raju Rangaswami . 2021 . Learning Cache Replacement with Cacheus . In Proc. of USENIX Conferecne on File and Storage Technologies. Liana Rodriguez, Farzana Yusuf, Steven Lyons, Eysler Paz, and Raju Rangaswami. 2021. Learning Cache Replacement with Cacheus. In Proc. of USENIX Conferecne on File and Storage Technologies."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.112"},{"key":"e_1_2_1_59_1","unstructured":"Daan Rutten Nico Christianson Debankur Mukherjee and Adam Wierman. 2022. Online Optimization with Untrusted Predictions. https:\/\/arxiv.org\/abs\/2202.03519  Daan Rutten Nico Christianson Debankur Mukherjee and Adam Wierman. 2022. Online Optimization with Untrusted Predictions. https:\/\/arxiv.org\/abs\/2202.03519"},{"key":"e_1_2_1_60_1","unstructured":"Sarah Sachs H\u00e9di Hadiji Tim van Erven and Crist\u00f3bal Guzm\u00e1n. 2022. Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness. https:\/\/arxiv.org\/abs\/2202.07554  Sarah Sachs H\u00e9di Hadiji Tim van Erven and Crist\u00f3bal Guzm\u00e1n. 2022. Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness. https:\/\/arxiv.org\/abs\/2202.07554"},{"key":"e_1_2_1_61_1","first-page":"180","article-title":"Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities","volume":"12","author":"Sadeghi Alireza","year":"2018","unstructured":"Alireza Sadeghi , Fatemeh Sheikholeslami , and Georgios B. Giannakis . 2018 . Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities . IEEE J. Select. Areas Commun. , Vol. 12 , 1 (2018), 180 -- 190 . Alireza Sadeghi, Fatemeh Sheikholeslami, and Georgios B. Giannakis. 2018. Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities. IEEE J. Select. Areas Commun. , Vol. 12, 1 (2018), 180--190.","journal-title":"IEEE J. Select. Areas Commun."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933780"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"e_1_2_1_64_1","doi-asserted-by":"crossref","unstructured":"T. Si Salem G. Neglia and S. Ioannidis. 2021a. No-Regret Caching via Online Mirror Descent. https:\/\/arxiv.org\/abs\/2101.12588  T. Si Salem G. Neglia and S. Ioannidis. 2021a. No-Regret Caching via Online Mirror Descent. https:\/\/arxiv.org\/abs\/2101.12588","DOI":"10.1109\/ICC42927.2021.9500487"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500487"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844985"},{"key":"e_1_2_1_67_1","volume-title":"Proc. of NeurIPS.","author":"Suggala Arun","year":"2020","unstructured":"Arun Suggala and Praneeth Netrapalli . 2020 a. Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games . In Proc. of NeurIPS. Arun Suggala and Praneeth Netrapalli. 2020a. Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games. In Proc. of NeurIPS."},{"key":"e_1_2_1_68_1","volume-title":"Proc. of ALT.","author":"Suggala Arun Sai","year":"2020","unstructured":"Arun Sai Suggala and Praneeth Netrapalli . 2020 b. Online Non-Convex Learning: Following the Perturbed Leader is Optimal . In Proc. of ALT. Arun Sai Suggala and Praneeth Netrapalli. 2020b. Online Non-Convex Learning: Following the Perturbed Leader is Optimal. In Proc. of ALT."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"volume-title":"Approximation algorithms","author":"Vazirani Vijay V","key":"e_1_2_1_70_1","unstructured":"Vijay V Vazirani . 2001. Approximation algorithms . Vol. 1 . Springer . Vijay V Vazirani. 2001. Approximation algorithms. Vol. 1. Springer."},{"key":"e_1_2_1_71_1","unstructured":"W. Wang and C. Lu. 2015. Projection onto the Capped Simplex. arXiv preprint arXiv:1503.01002 (2015).  W. Wang and C. Lu. 2015. Projection onto the Capped Simplex. arXiv preprint arXiv:1503.01002 (2015)."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3072423"},{"volume-title":"Proc. of ACM Mobihoc.","author":"Zhou Z.","key":"e_1_2_1_73_1","unstructured":"Z. Zhou , X. Chen , W. Wu , D. Wu , and J. Zhang . 2019. Predictive Online Server Provisioning for Cost-Efficient IoT Data Streaming Across Collaborative Edges . In Proc. of ACM Mobihoc. Z. Zhou, X. Chen, W. Wu, D. Wu, and J. Zhang. 2019. Predictive Online Server Provisioning for Cost-Efficient IoT Data Streaming Across Collaborative Edges. In Proc. of ACM Mobihoc."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.09.022"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570608","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3570608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:17Z","timestamp":1750178777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":74,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.1145\/3570608"],"URL":"https:\/\/doi.org\/10.1145\/3570608","relation":{},"ISSN":["2476-1249"],"issn-type":[{"type":"electronic","value":"2476-1249"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"2022-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}