{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:57:02Z","timestamp":1767988622929,"version":"3.49.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T00:00:00Z","timestamp":1511222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100017142","name":"Italian National Group for Scientific Computation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100017142","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Bodossaki Foundation, Greece"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2017,12,31]]},"abstract":"<jats:p>Most of the caching algorithms are oblivious to requests\u2019 timescale, but caching systems are capacity constrained and, in practical cases, the hit rate may be limited by the cache\u2019s impossibility to serve requests fast enough. In particular, the hard-disk access time can be the key factor capping cache performance. In this article, we present a new cache replacement policy that takes advantage of a hierarchical caching architecture, and in particular of access-time difference between memory and disk. Our policy is optimal when requests follow the independent reference model and significantly reduces the hard-disk load, as shown also by our realistic, trace-driven evaluation. Moreover, we show that our policy can be considered in a more general context, since it can be easily adapted to minimize any retrieval cost, as far as costs add over cache misses.<\/jats:p>","DOI":"10.1145\/3149001","type":"journal-article","created":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T16:25:08Z","timestamp":1511367908000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Access-Time-Aware Cache Algorithms"],"prefix":"10.1145","volume":"2","author":[{"given":"Giovanni","family":"Neglia","sequence":"first","affiliation":[{"name":"Universit\u00e9 C\u00f4te d\u2019Azur, Inria, France"}]},{"given":"Damiano","family":"Carra","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Verona, Verona, Italy"}]},{"given":"Mingdong","family":"Feng","sequence":"additional","affiliation":[{"name":"Akamai Technologies, MA, USA"}]},{"given":"Vaishnav","family":"Janardhan","sequence":"additional","affiliation":[{"name":"Akamai Technologies, MA, USA"}]},{"given":"Pietro","family":"Michiardi","sequence":"additional","affiliation":[{"name":"Eurecom, France"}]},{"given":"Dimitra","family":"Tsigkari","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d\u2019Azur, Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2017,11,21]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 4th International World Wide Web Conference (WWW\u201995)","author":"Abrams Marc","unstructured":"Marc Abrams , Charles R. Standridge , Ghaleb Abdulla , Stephen Williams , and Edward A. Fox . 1995. Caching proxies: Limitations and potentials . In Proceedings of the 4th International World Wide Web Conference (WWW\u201995) . Marc Abrams, Charles R. Standridge, Ghaleb Abdulla, Stephen Williams, and Edward A. Fox. 1995. Caching proxies: Limitations and potentials. In Proceedings of the 4th International World Wide Web Conference (WWW\u201995)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2433296"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/301453.301482"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201917)","author":"Berger Daniel S.","year":"2017","unstructured":"Daniel S. Berger , Ramesh K. Sitaraman , and Mor Harchol-Balter . 2017 . AdaptSize: Orchestrating the hot object memory cache in a content delivery network . In Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201917) . Daniel S. Berger, Ramesh K. Sitaraman, and Mor Harchol-Balter. 2017. AdaptSize: Orchestrating the hot object memory cache in a content delivery network. In Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201917)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500098.2500106"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_61"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1267279.1267297"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"e_1_2_1_9_1","volume-title":"Denning","author":"Coffman Edward Grady","year":"1973","unstructured":"Edward Grady Coffman and Peter J . Denning . 1973 . Operating Systems Theory. Prentice-Hall , Englewood Cliffs, NJ. http:\/\/opac.inria.fr\/record=b1079172 Edward Grady Coffman and Peter J. Denning. 1973. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, NJ. http:\/\/opac.inria.fr\/record=b1079172"},{"key":"e_1_2_1_10_1","volume-title":"The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM\u201916)","author":"Dehghan Mostafa","unstructured":"Mostafa Dehghan , Laurent Massouli\u00e9 , Don Towsley , Dan Menasche , and Y. C. Tay . 2016. A utility optimization approach to network cache design . In The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM\u201916) . 1--9. Mostafa Dehghan, Laurent Massouli\u00e9, Don Towsley, Dan Menasche, and Y. C. Tay. 2016. A utility optimization approach to network cache design. In The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM\u201916). 1--9."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80014-7"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.006"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 24th International Teletraffic Congress (ITC\u201912). International Teletraffic Congress, Article 8, 8 pages.","author":"Fricker Christine","year":"2012","unstructured":"Christine Fricker , Philippe Robert , and James Roberts . 2012 a. A versatile and accurate approximation for LRU cache performance . In Proceedings of the 24th International Teletraffic Congress (ITC\u201912). International Teletraffic Congress, Article 8, 8 pages. Christine Fricker, Philippe Robert, and James Roberts. 2012a. A versatile and accurate approximation for LRU cache performance. In Proceedings of the 24th International Teletraffic Congress (ITC\u201912). International Teletraffic Congress, Article 8, 8 pages."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193511"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896380"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830400625X"},{"key":"e_1_2_1_18_1","volume-title":"Knapsack Problems","author":"Kellerer Hans","unstructured":"Hans Kellerer , Ulrich Pferschy , and David Pisinger . 2004. Knapsack Problems . Springer , Berlin . I--XX, 1--546 pages. Hans Kellerer, Ulrich Pferschy, and David Pisinger. 2004. Knapsack Problems. Springer, Berlin. I--XX, 1--546 pages."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 35th IEEE International Conference on Computer Communications (INFOCOM\u201916)","author":"Li Suoheng","unstructured":"Suoheng Li , Jie Xu , Mihaela van der Schaar, and Weiping Li. 2016. Popularity-driven content caching . In Proceedings of the 35th IEEE International Conference on Computer Communications (INFOCOM\u201916) . Suoheng Li, Jie Xu, Mihaela van der Schaar, and Weiping Li. 2016. Popularity-driven content caching. In Proceedings of the 35th IEEE International Conference on Computer Communications (INFOCOM\u201916)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848145"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.127"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057192"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.675641"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1842733.1842736"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2541320"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847938"},{"key":"e_1_2_1_29_1","volume-title":"The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM\u201916)","author":"Shafiq M. Zubair","unstructured":"M. Zubair Shafiq , Amir R. Khakpour , and Alex X. Liu . 2016. Characterizing caching workload of a large commercial content delivery network . In The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM\u201916) . IEEE, 1--9. M. Zubair Shafiq, Amir R. Khakpour, and Alex X. Liu. 2016. Characterizing caching workload of a large commercial content delivery network. In The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM\u201916). IEEE, 1--9."},{"key":"e_1_2_1_30_1","volume-title":"14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt\u201916)","author":"Shukla Samta","unstructured":"Samta Shukla and Alhussein A. Abouzeid . 2016. On designing optimal memory damage aware caching policies for content-centric networks . In 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt\u201916) . 163--170. Samta Shukla and Alhussein A. Abouzeid. 2016. On designing optimal memory damage aware caching policies for content-centric networks. In 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt\u201916). 163--170."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(01)00045-1"},{"key":"e_1_2_1_32_1","volume-title":"Bruckner","author":"Thomson Brian S.","year":"2001","unstructured":"Brian S. Thomson , Judith B. Bruckner , and Andrew M . Bruckner . 2001 . Elementary Real Analysis. Prentice-Hall . Brian S. Thomson, Judith B. Bruckner, and Andrew M. Bruckner. 2001. Elementary Real Analysis. Prentice-Hall."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"e_1_2_1_34_1","volume-title":"Encyclopedia of Algorithms","author":"Young Neal E.","unstructured":"Neal E. Young . 2008. Online paging and caching . In Encyclopedia of Algorithms . Springer US , Boston , 601--604. Neal E. Young. 2008. Online paging and caching. In Encyclopedia of Algorithms. Springer US, Boston, 601--604."}],"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\/3149001","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3149001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:37:02Z","timestamp":1750282622000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,21]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12,31]]}},"alternative-id":["10.1145\/3149001"],"URL":"https:\/\/doi.org\/10.1145\/3149001","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"value":"2376-3639","type":"print"},{"value":"2376-3647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,21]]},"assertion":[{"value":"2016-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}