{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:22:48Z","timestamp":1761402168886,"version":"3.41.0"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CNPq, FAPERJ","award":["MCTIC-FAPESP-2015\/24434-5"],"award-info":[{"award-number":["MCTIC-FAPESP-2015\/24434-5"]}]},{"name":"National Science Foundation","award":["CNS-1617437"],"award-info":[{"award-number":["CNS-1617437"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2021,3,31]]},"abstract":"<jats:p>Caching is a fundamental element of networking systems since the early days of the Internet. By filtering requests toward custodians, caches reduce the bandwidth required by the latter and the delay experienced by clients. The requests that are not served by a cache, in turn, comprise its miss stream. We refer to the dependence of the cache state and miss stream on its history as hysteresis. Although hysteresis is at the core of caching systems, a dimension that has not been systematically studied in previous works relates to its impact on caching systems between misses, evictions, and insertions.<\/jats:p>\n          <jats:p>In this article, we propose novel mechanisms and models to leverage hysteresis on cache evictions and insertions. The proposed solutions extend TTL-like mechanisms and rely on two knobs to tune the time between insertions and evictions given a target hit rate. We show the general benefits of hysteresis and the particular improvement of the two thresholds strategy in reducing download times, making the system more predictable and accounting for different costs associated with object retrieval.<\/jats:p>","DOI":"10.1145\/3450564","type":"journal-article","created":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T02:06:54Z","timestamp":1622340414000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["The Role of Hysteresis in Caching Systems"],"prefix":"10.1145","volume":"6","author":[{"given":"Guilherme","family":"Domingues","sequence":"first","affiliation":[{"name":"State University of Rio de Janeiro (UERJ), Brazil"}]},{"given":"Gabriel","family":"Mendon\u00e7a","sequence":"additional","affiliation":[{"name":"Federal University of Rio de Janeiro (UFRJ), Brazil"}]},{"given":"Edmundo De Souza E","family":"Silva","sequence":"additional","affiliation":[{"name":"Federal University of Rio de Janeiro (UFRJ), Brazil"}]},{"given":"Rosa M. M.","family":"Le\u00e3o","sequence":"additional","affiliation":[{"name":"Federal University of Rio de Janeiro (UFRJ), Brazil"}]},{"given":"Daniel S.","family":"Menasch\u00e9","sequence":"additional","affiliation":[{"name":"Federal University of Rio de Janeiro (UFRJ), Brazil"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Mostafa","family":"Dehghan","sequence":"additional","affiliation":[{"name":"Google Inc, Mountain View, USA"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts at Amherst (UMass, Amherst), Amherst, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,5,29]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Amazon. 2017. Amazon Elastic Cache: Amazon Web Services. Retrieved from http:\/\/aws.amazon.com\/elasticache\/.  Amazon. 2017. Amazon Elastic Cache: Amazon Web Services. Retrieved from http:\/\/aws.amazon.com\/elasticache\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2208199"},{"volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201909)","author":"Badam Anirudh","key":"e_1_2_1_3_1","unstructured":"Anirudh Badam , KyoungSoo Park , Vivek S. Pai , and Larry L. Peterson . 2009. HashCache: Cache storage for the next billion . In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201909) . Anirudh Badam, KyoungSoo Park, Vivek S. Pai, and Larry L. Peterson. 2009. HashCache: Cache storage for the next billion. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201909)."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057215"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.001"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825259"},{"key":"e_1_2_1_7_1","unstructured":"C\u00e9sar Bernardini Thomas Silverston and Athanasios Vasilakos. 2016. Caching strategies for information centric networking: Opportunities and challenges. Retrieved from https:\/\/arXiv:1606.07630.  C\u00e9sar Bernardini Thomas Silverston and Athanasios Vasilakos. 2016. Caching strategies for information centric networking: Opportunities and challenges. Retrieved from https:\/\/arXiv:1606.07630."},{"volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIXATC\u201917)","author":"Blankstein Aaron","key":"e_1_2_1_9_1","unstructured":"Aaron Blankstein , Siddhartha Sen , and Michael J. Freedman . 2017. Hyperbolic caching: Flexible caching for web applications . In Proceedings of the USENIX Annual Technical Conference (USENIXATC\u201917) . 499\u2013511. Aaron Blankstein, Siddhartha Sen, and Michael J. Freedman. 2017. Hyperbolic caching: Flexible caching for web applications. In Proceedings of the USENIX Annual Technical Conference (USENIXATC\u201917). 499\u2013511."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the USENIX Summer Conference","volume":"16","author":"\u00a0al Jeff Bonwick","year":"1994","unstructured":"Jeff Bonwick et \u00a0al . 1994 . The slab allocator: An object-caching kernel memory allocator . In Proceedings of the USENIX Summer Conference , Vol. 16 . Jeff Bonwick et\u00a0al. 1994. The slab allocator: An object-caching kernel memory allocator. In Proceedings of the USENIX Summer Conference, Vol. 16."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the USENIX Symposium on Internet Technologies and Systems","volume":"12","author":"Cao Pei","year":"1997","unstructured":"Pei Cao and Sandy Irani . 1997 . Cost-aware www proxy caching algorithms . In Proceedings of the USENIX Symposium on Internet Technologies and Systems , Vol. 12 . 193\u2013206. Pei Cao and Sandy Irani. 1997. Cost-aware www proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, Vol. 12. 193\u2013206."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214137"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2614805"},{"key":"e_1_2_1_14_1","unstructured":"Niklas Carlsson and Derek Eager. 2018. Caching in the clouds: Optimized dynamic cache instantiation in content delivery systems. Retrieved from https:\/\/arXiv:1803.03914.  Niklas Carlsson and Derek Eager. 2018. Caching in the clouds: Optimized dynamic cache instantiation in content delivery systems. Retrieved from https:\/\/arXiv:1803.03914."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2018.09.006"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.003"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2836183.2836188"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737546"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"e_1_2_1_20_1","unstructured":"Ludmila Cherkasova. 1998. Improving WWW Proxies Performance with Greedy-dual-size-frequency Caching Policy. Hewlett-Packard Laboratories.  Ludmila Cherkasova. 1998. Improving WWW Proxies Performance with Greedy-dual-size-frequency Caching Policy. Hewlett-Packard Laboratories."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078505.3078527"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633043"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1530873.1530886"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201916)","author":"Dehghan Mostafa","key":"e_1_2_1_24_1","unstructured":"Mostafa Dehghan , Laurent Massoulie , Don Towsley , Daniel Menasche , and Y. C. Tay . 2016. A utility optimization approach to network cache design . In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201916) . Mostafa Dehghan, Laurent Massoulie, Don Towsley, Daniel Menasche, and Y. C. Tay. 2016. A utility optimization approach to network cache design. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201916)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218465"},{"key":"e_1_2_1_26_1","volume-title":"Rosa M. M. Leao, and Daniel S. Menasche.","author":"Domingues Guilherme","year":"2015","unstructured":"Guilherme Domingues , Edmundo de Souza e Silva , Rosa M. M. Leao, and Daniel S. Menasche. 2015 . Flexible content placement in cache networks using reinforced counters. Retrieved from https:\/\/arXiv:1501.03446. Guilherme Domingues, Edmundo de Souza e Silva, Rosa M. M. Leao, and Daniel S. Menasche. 2015. Flexible content placement in cache networks using reinforced counters. Retrieved from https:\/\/arXiv:1501.03446."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.03.005"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"E. Souza\n       e \n      Silva\n     and \n      H. R.\n      Gail\n  . \n  2000\n  . Transient Solutions for Markov Chains in Computational Probability International Series in Operations Research\n   & Management Science. Vol. \n  24\n  . \n  Springer Boston MA 43\u201379.  E. Souza e Silva and H. R. Gail. 2000. Transient Solutions for Markov Chains in Computational Probability International Series in Operations Research & Management Science. Vol. 24. Springer Boston MA 43\u201379.","DOI":"10.1007\/978-1-4757-4828-4_3"},{"key":"e_1_2_1_29_1","article-title":"TinyLFU: A highly efficient cache admission policy","volume":"13","author":"Einziger Gil","year":"2017","unstructured":"Gil Einziger , Roy Friedman , and Ben Manes . 2017 . TinyLFU: A highly efficient cache admission policy . ACM Trans. Stor. 13 , 4 (2017), 35:1\u201335:31. Gil Einziger, Roy Friedman, and Ben Manes. 2017. TinyLFU: A highly efficient cache admission policy. ACM Trans. Stor. 13, 4 (2017), 35:1\u201335:31.","journal-title":"ACM Trans. Stor."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the IEEE International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS\u201912)","author":"Fofack N. Choungmo","year":"2012","unstructured":"N. Choungmo Fofack , Philippe Nain , Giovanni Neglia , and Don Towsley . 2012 . Analysis of TTL-based cache networks . In Proceedings of the IEEE International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS\u201912) . N. Choungmo Fofack, Philippe Nain, Giovanni Neglia, and Don Towsley. 2012. Analysis of TTL-based cache networks. In Proceedings of the IEEE International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS\u201912)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.006"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896380"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2017.09.002"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 20th IEEE International Conference on Distributed Computing Systems. IEEE, 254\u2013261","author":"Jin Shudong","year":"2000","unstructured":"Shudong Jin and Azer Bestavros . 2000 . Popularity-aware greedy dual-size web proxy caching algorithms . In Proceedings of the 20th IEEE International Conference on Distributed Computing Systems. IEEE, 254\u2013261 . Shudong Jin and Azer Bestavros. 2000. Popularity-aware greedy dual-size web proxy caching algorithms. In Proceedings of the 20th IEEE International Conference on Distributed Computing Systems. IEEE, 254\u2013261."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-007-0174-9"},{"key":"e_1_2_1_37_1","volume-title":"Taylor","author":"Karlin Samuel","year":"1981","unstructured":"Samuel Karlin and Howard E . Taylor . 1981 . A Second Course in Stochastic Processes. Elsevier . Samuel Karlin and Howard E. Taylor. 1981. A Second Course in Stochastic Processes. Elsevier."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2018.8390281"},{"key":"e_1_2_1_39_1","unstructured":"Leonard Kleinrock. 1975. Queuing Systems Volume I: Theory.  Leonard Kleinrock. 1975. Queuing Systems Volume I: Theory."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the International Conference on Database Theory (ICDT\u201905)","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally , Divyakant Agrawal , and Amr El Abbadi . 2005 . Efficient computation of frequent and top-k elements in data streams . In Proceedings of the International Conference on Database Theory (ICDT\u201905) . Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. 2005. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the International Conference on Database Theory (ICDT\u201905)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.127"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057192"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018584.2018596"},{"volume-title":"Proceedings of the IEEE International Symposium on High-Performance Computer Architecture (HPCA\u201907)","author":"Qureshi Moinuddin K.","key":"e_1_2_1_46_1","unstructured":"Moinuddin K. Qureshi , M. Aater Suleman , and Yale N. Patt . 2007. Line distillation: Increasing cache capacity by filtering unused words in cache lines . In Proceedings of the IEEE International Symposium on High-Performance Computer Architecture (HPCA\u201907) . Moinuddin K. Qureshi, M. Aater Suleman, and Yale N. Patt. 2007. Line distillation: Increasing cache capacity by filtering unused words in cache lines. In Proceedings of the IEEE International Symposium on High-Performance Computer Architecture (HPCA\u201907)."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking.2017.8264840"},{"key":"e_1_2_1_48_1","unstructured":"Katsunobu Sasanuma Robert Hampshire and Alan Scheller-Wolf. 2019. Markov chain decomposition based on total expectation theorem. Retrieved from https:\/\/arXiv:1901.06780.  Katsunobu Sasanuma Robert Hampshire and Alan Scheller-Wolf. 2019. Markov chain decomposition based on total expectation theorem. Retrieved from https:\/\/arXiv:1901.06780."},{"volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201916)","author":"Shafiq M. Zubair","key":"e_1_2_1_49_1","unstructured":"M. Zubair Shafiq , Amir R. Khakpour , and Alex X. Liu . 2016. Characterizing caching workload of a large commercial content delivery network . In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201916) . M. Zubair Shafiq, Amir R. Khakpour, and Alex X. Liu. 2016. Characterizing caching workload of a large commercial content delivery network. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201916)."},{"key":"e_1_2_1_50_1","volume-title":"et\u00a0al","author":"Silberschatz Abraham","year":"1997","unstructured":"Abraham Silberschatz , Henry F. Korth , Shashank Sudarshan , et\u00a0al . 1997 . Database System Concepts. Vol. 5 . McGraw-Hill New York . Retrieved from https:\/\/www.dummies.com\/programming\/databases\/basics-of-the-database-buffer-cache-in-oracle-12c\/. Abraham Silberschatz, Henry F. Korth, Shashank Sudarshan, et\u00a0al. 1997. Database System Concepts. Vol. 5. McGraw-Hill New York. Retrieved from https:\/\/www.dummies.com\/programming\/databases\/basics-of-the-database-buffer-cache-in-oracle-12c\/."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-016-0567-8"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.1997.623344"},{"key":"e_1_2_1_53_1","unstructured":"Wikipedia. 2020. Schmitt Trigger. Wikimedia. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Schmitt_trigger.  Wikipedia. 2020. Schmitt Trigger. Wikimedia. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Schmitt_trigger."},{"key":"e_1_2_1_54_1","unstructured":"Wikipedia. 2020. SSD. Wikimedia. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Solid-state_drive.  Wikipedia. 2020. SSD. Wikimedia. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Solid-state_drive."},{"key":"e_1_2_1_55_1","unstructured":"Wikipedia. 2020. Zswap in Linux Kernel. Wikimedia. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Zswap.  Wikipedia. 2020. Zswap in Linux Kernel. Wikimedia. Retrieved from https:\/\/en.wikipedia.org\/wiki\/Zswap."},{"key":"e_1_2_1_56_1","unstructured":"Craig E. Wills. 2020. Memory Management. Retrieved from http:\/\/web.cs.wpi.edu\/ cs3013\/b00\/week4-memmgt\/week4-memmgt.html and https:\/\/elinux.org\/images\/b\/b9\/Elc2013-embedded-memory-management.pdf.  Craig E. Wills. 2020. Memory Management. Retrieved from http:\/\/web.cs.wpi.edu\/ cs3013\/b00\/week4-memmgt\/week4-memmgt.html and https:\/\/elinux.org\/images\/b\/b9\/Elc2013-embedded-memory-management.pdf."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1685872.1685986"},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the ACM Symposium on Discrete Algorithms (SODA\u201991)","volume":"91","author":"Young Neal E.","year":"1991","unstructured":"Neal E. Young . 1991 . On-line caching as cache size varies . In Proceedings of the ACM Symposium on Discrete Algorithms (SODA\u201991) , Vol. 91 . 241\u2013250. Neal E. Young. 1991. On-line caching as cache size varies. In Proceedings of the ACM Symposium on Discrete Algorithms (SODA\u201991), Vol. 91. 241\u2013250."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/3485849.3485869"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3450564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3450564","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3450564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:50Z","timestamp":1750193270000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3450564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,31]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3,31]]}},"alternative-id":["10.1145\/3450564"],"URL":"https:\/\/doi.org\/10.1145\/3450564","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2021,3,31]]},"assertion":[{"value":"2019-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}