{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:12:49Z","timestamp":1774926769849,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1763617, CNS-1901137, CNS-2106463"],"award-info":[{"award-number":["CNS-1763617, CNS-1901137, CNS-2106463"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,25]]},"DOI":"10.1145\/3517745.3561466","type":"proceedings-article","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T21:28:36Z","timestamp":1666387716000},"page":"679-693","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["JEDI"],"prefix":"10.1145","author":[{"given":"Anirudh","family":"Sabnis","sequence":"first","affiliation":[{"name":"Univ. of Massachusetts Amherst"}]},{"given":"Ramesh K.","family":"Sitaraman","sequence":"additional","affiliation":[{"name":"Univ. of Massachusetts Amherst & Akamai Technologies"}]}],"member":"320","published-online":{"date-parts":[[2022,10,25]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"B tree wikipedia. https:\/\/en.wikipedia.org\/wiki\/B-tree.  B tree wikipedia. https:\/\/en.wikipedia.org\/wiki\/B-tree."},{"key":"e_1_3_2_2_2_1","unstructured":"Open zfs. https:\/\/en.wikipedia.org\/wiki\/OpenZFS.  Open zfs. https:\/\/en.wikipedia.org\/wiki\/OpenZFS."},{"key":"e_1_3_2_2_3_1","unstructured":"Total variation distance. https:\/\/en.wikipedia.org\/wiki\/Total_variation_distance_of_probability_measures.  Total variation distance. https:\/\/en.wikipedia.org\/wiki\/Total_variation_distance_of_probability_measures."},{"key":"e_1_3_2_2_4_1","unstructured":"Zfs caching. https:\/\/en.wikipedia.org\/wiki\/ZFS.  Zfs caching. https:\/\/en.wikipedia.org\/wiki\/ZFS."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.373516"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00116-9"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MTDT.2004.1327979"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/773146.773043"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/382006.383200"},{"key":"e_1_3_2_2_10_1","first-page":"214","volume-title":"International conference on machine learning","author":"Arjovsky M.","year":"2017","unstructured":"M. Arjovsky , S. Chintala , and L. Bottou . Wasserstein generative adversarial networks . In International conference on machine learning , pages 214 -- 223 . PMLR, 2017 . M. Arjovsky, S. Chintala, and L. Bottou. Wasserstein generative adversarial networks. In International conference on machine learning, pages 214--223. PMLR, 2017."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649565"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019236319752"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277897"},{"key":"e_1_3_2_2_14_1","first-page":"483","volume-title":"USENIX NSDI","author":"Berger D. S.","year":"2017","unstructured":"D. S. Berger , R. Sitaraman , and M. Harchol-Balter . Adaptsize: Orchestrating the hot object memory cache in a cdn . In USENIX NSDI , pages 483 -- 498 , March 2017 . D. S. Berger, R. Sitaraman, and M. Harchol-Balter. Adaptsize: Orchestrating the hot object memory cache in a cdn. In USENIX NSDI, pages 483--498, March 2017."},{"key":"e_1_3_2_2_15_1","first-page":"483","volume-title":"14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17)","author":"Berger D. S.","year":"2017","unstructured":"D. S. Berger , R. K. Sitaraman , and M. Harchol-Balter . Adaptsize: Orchestrating the hot object memory cache in a content delivery network . In 14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17) , pages 483 -- 498 , 2017 . D. S. Berger, R. K. Sitaraman, and M. Harchol-Balter. Adaptsize: Orchestrating the hot object memory cache in a content delivery network. In 14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17), pages 483--498, 2017."},{"key":"e_1_3_2_2_16_1","first-page":"499","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Blankstein A.","year":"2017","unstructured":"A. Blankstein , S. Sen , and M. J. Freedman . Hyperbolic caching: Flexible caching for web applications . In 2017 USENIX Annual Technical Conference (USENIX ATC 17) , pages 499 -- 511 , 2017 . A. Blankstein, S. Sen, and M. J. Freedman. Hyperbolic caching: Flexible caching for web applications. In 2017 USENIX Annual Technical Conference (USENIX ATC 17), pages 499--511, 2017."},{"key":"e_1_3_2_2_17_1","first-page":"95","volume-title":"International Workshop on Approximation and Online Algorithms","author":"Boyar J.","year":"2006","unstructured":"J. Boyar , M. R. Ehmsen , and K. S. Larsen . Theoretical evidence for the superiority of lru-2 over lru for the paging problem . In International Workshop on Approximation and Online Algorithms , pages 95 -- 107 . Springer , 2006 . J. Boyar, M. R. Ehmsen, and K. S. Larsen. Theoretical evidence for the superiority of lru-2 over lru for the paging problem. In International Workshop on Approximation and Online Algorithms, pages 95--107. Springer, 2006."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00285-7"},{"key":"e_1_3_2_2_19_1","volume-title":"Understanding the characteristics of internet short video sharing: Youtube as a case study. arXiv preprint arXiv:0707.3670","author":"Cheng X.","year":"2007","unstructured":"X. Cheng , C. Dale , and J. Liu . Understanding the characteristics of internet short video sharing: Youtube as a case study. arXiv preprint arXiv:0707.3670 , 2007 . X. Cheng, C. Dale, and J. Liu. Understanding the characteristics of internet short video sharing: Youtube as a case study. arXiv preprint arXiv:0707.3670, 2007."},{"key":"e_1_3_2_2_20_1","volume-title":"CA","author":"Cherkasova L.","year":"1998","unstructured":"L. Cherkasova . Improving WWW proxies performance with greedy-dual-size-frequency caching policy. Hewlett-Packard Laboratories Palo Alto , CA , 1998 . L. Cherkasova. Improving WWW proxies performance with greedy-dual-size-frequency caching policy. Hewlett-Packard Laboratories Palo Alto, CA, 1998."},{"key":"e_1_3_2_2_21_1","first-page":"379","volume-title":"13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16)","author":"Cidon A.","year":"2016","unstructured":"A. Cidon , A. Eisenman , M. Alizadeh , and S. Katti . Cliffhanger: Scaling performance cliffs in web memory caches . In 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16) , pages 379 -- 392 , 2016 . A. Cidon, A. Eisenman, M. Alizadeh, and S. Katti. Cliffhanger: Scaling performance cliffs in web memory caches. In 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16), pages 379--392, 2016."},{"key":"e_1_3_2_2_22_1","unstructured":"T. S. P. E. Corporation. Specweb96 benchmark. https:\/\/www.spec.org\/web96\/.  T. S. P. E. Corporation. Specweb96 benchmark. https:\/\/www.spec.org\/web96\/."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/98457.98525"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2002.1036038"},{"key":"e_1_3_2_2_25_1","volume-title":"12th {USENIX} Workshop on Hot Topics in Storage and File Systems (HotStorage 20)","author":"Eytan O.","year":"2020","unstructured":"O. Eytan , D. Harnik , E. Ofer , R. Friedman , and R. Kat . It's time to revisit {LRU} vs.{FIFO} . In 12th {USENIX} Workshop on Hot Topics in Storage and File Systems (HotStorage 20) , 2020 . O. Eytan, D. Harnik, E. Ofer, R. Friedman, and R. Kat. It's time to revisit {LRU} vs.{FIFO}. In 12th {USENIX} Workshop on Hot Topics in Storage and File Systems (HotStorage 20), 2020."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1012889.1012894"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298310"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"},{"key":"e_1_3_2_2_29_1","volume-title":"PLRU. epubli","author":"Grund D.","year":"2012","unstructured":"D. Grund . Static Cache Analysis for Real-Time Systems : LRU, FIFO , PLRU. epubli , 2012 . D. Grund. Static Cache Analysis for Real-Time Systems: LRU, FIFO, PLRU. epubli, 2012."},{"key":"e_1_3_2_2_30_1","volume-title":"Essential Virtual SAN (VSAN): Administrator's Guide to VMware Virtual SAN","author":"Hogan C.","year":"2016","unstructured":"C. Hogan and D. Epping . Essential Virtual SAN (VSAN): Administrator's Guide to VMware Virtual SAN . VMware Press , 2016 . C. Hogan and D. Epping. Essential Virtual SAN (VSAN): Administrator's Guide to VMware Virtual SAN. VMware Press, 2016."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522722"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511340"},{"key":"e_1_3_2_2_33_1","first-page":"439","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases","author":"Johnson T.","year":"1994","unstructured":"T. Johnson , D. Shasha , : a low overhead high performance bu er management replacement algorithm . In Proceedings of the 20th International Conference on Very Large Data Bases , pages 439 -- 450 . Citeseer , 1994 . T. Johnson, D. Shasha, et al. 2q: a low overhead high performance bu er management replacement algorithm. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 439--450. Citeseer, 1994."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2001.990676"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.268884"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/NTMS.2012.6208742"},{"key":"e_1_3_2_2_37_1","first-page":"485","volume-title":"Proc. IFIP 1971 Congress, Ljubljana","author":"King W.","year":"1972","unstructured":"W. King . Analysis of paging algorithms . In Proc. IFIP 1971 Congress, Ljubljana , pages 485 -- 490 . North-Holland , 1972 . W. King. Analysis of paging algorithms. In Proc. IFIP 1971 Congress, Ljubljana, pages 485--490. North-Holland, 1972."},{"key":"e_1_3_2_2_38_1","volume-title":"Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies","author":"Lee D.","year":"2001","unstructured":"D. Lee , J. Choi , J.-H. Kim , S. H. Noh , S. L. Min , Y. Cho , and C. S. Kim . Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies . IEEE transactions on Computers , 50(12):1352--1361, 2001 . D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE transactions on Computers, 50(12):1352--1361, 2001."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIT\/IUCC\/DASC\/PICOM.2015.191"},{"key":"e_1_3_2_2_40_1","volume-title":"Generating high-fidelity, synthetic time series datasets with doppelganger. arXiv preprint arXiv:1909.13403","author":"Lin Z.","year":"2019","unstructured":"Z. Lin , A. Jain , C. Wang , G. Fanti , and V. Sekar . Generating high-fidelity, synthetic time series datasets with doppelganger. arXiv preprint arXiv:1909.13403 , 2019 . Z. Lin, A. Jain, C. Wang, G. Fanti, and V. Sekar. Generating high-fidelity, synthetic time series datasets with doppelganger. arXiv preprint arXiv:1909.13403, 2019."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_3_2_2_42_1","volume-title":"Computer Sciences Dept","author":"Mahanti A.","year":"1999","unstructured":"A. Mahanti , C. Williamson , and D. Eager . Web proxy workload characterization. Progress Report , Computer Sciences Dept , Univ. of Saskatchewan , 1999 . A. Mahanti, C. Williamson, and D. Eager. Web proxy workload characterization. Progress Report, Computer Sciences Dept, Univ. of Saskatchewan, 1999."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_2_2_44_1","first-page":"115","volume-title":"Fast","volume":"3","author":"Megiddo N.","year":"2003","unstructured":"N. Megiddo and D. S. Modha . Arc: A self-tuning, low overhead replacement cache . In Fast , volume 3 , pages 115 -- 130 , 2003 . N. Megiddo and D. S. Modha. Arc: A self-tuning, low overhead replacement cache. In Fast, volume 3, pages 115--130, 2003."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1090694.1090708"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/306225.306235"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1842733.1842736"},{"key":"e_1_3_2_2_48_1","volume-title":"10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010","author":"Reineke D.","year":"2010","unstructured":"D. reason and J. Reineke . Toward precise plru cache analysis . In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010 ). Schloss Dagstuhl-Leibniz Center for Computer Science , 2010 . D. reason and J. Reineke. Toward precise plru cache analysis. In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010). Schloss Dagstuhl-Leibniz Center for Computer Science, 2010."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.576"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3487552.3487845"},{"key":"e_1_3_2_2_51_1","volume-title":"beginner's guide","author":"Saini K.","year":"2011","unstructured":"K. Saini . Squid Proxy Server 3.1 : beginner's guide . Packt Publishing Ltd , 2011 . K. Saini. Squid Proxy Server 3.1: beginner's guide. Packt Publishing Ltd, 2011."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524379"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2016.7581265"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3143361.3143368"},{"key":"e_1_3_2_2_55_1","first-page":"543","volume-title":"USENIX Annual Technical Conference (USENIX ATC 20)","author":"Sundarrajan A.","year":"2020","unstructured":"A. Sundarrajan , M. Kasbekar , R. K. Sitaraman , and S. Shukla . Midgress-aware traffic provisioning for content delivery . In USENIX Annual Technical Conference (USENIX ATC 20) , pages 543 -- 557 . USENIX Association , 2020 . A. Sundarrajan, M. Kasbekar, R. K. Sitaraman, and S. Shukla. Midgress-aware traffic provisioning for content delivery. In USENIX Annual Technical Conference (USENIX ATC 20), pages 543--557. USENIX Association, 2020."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/776322.776327"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2020.102121"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/0-387-27727-7_1","volume-title":"Web workload characterization: Ten years later. Web content delivery","author":"Williams A.","year":"2005","unstructured":"A. Williams , M. Arlitt , C. Williamson , and K. Barker . Web workload characterization: Ten years later. Web content delivery , pages 3 -- 21 , 2005 . A. Williams, M. Arlitt, C. Williamson, and K. Barker. Web workload characterization: Ten years later. Web content delivery, pages 3--21, 2005."},{"key":"e_1_3_2_2_59_1","volume-title":"Stan: Synthetic network traffic generation using autoregressive neural models. arXiv preprint arXiv:2009.12740","author":"Xu S.","year":"2020","unstructured":"S. Xu , M. Marwah , and N. Ramakrishnan . Stan: Synthetic network traffic generation using autoregressive neural models. arXiv preprint arXiv:2009.12740 , 2020 . S. Xu, M. Marwah, and N. Ramakrishnan. Stan: Synthetic network traffic generation using autoregressive neural models. arXiv preprint arXiv:2009.12740, 2020."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/3488766.3488777"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502584"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3544216.3544251"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/2846134"}],"event":{"name":"IMC '22: ACM Internet Measurement Conference","location":"Nice France","acronym":"IMC '22","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","SIGCOMM ACM Special Interest Group on Data Communication","USENIX Assoc USENIX Assoc"]},"container-title":["Proceedings of the 22nd ACM Internet Measurement Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517745.3561466","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517745.3561466","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517745.3561466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:17Z","timestamp":1750182557000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517745.3561466"}},"subtitle":["model-driven trace generation for cache simulations"],"short-title":[],"issued":{"date-parts":[[2022,10,25]]},"references-count":63,"alternative-id":["10.1145\/3517745.3561466","10.1145\/3517745"],"URL":"https:\/\/doi.org\/10.1145\/3517745.3561466","relation":{},"subject":[],"published":{"date-parts":[[2022,10,25]]},"assertion":[{"value":"2022-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}