{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:26:03Z","timestamp":1783614363098,"version":"3.55.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T00:00:00Z","timestamp":1383523200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2013,11,4]]},"abstract":"<jats:p>The dimensioning of caching systems represents a difficult task in the design of infrastructures for content distribution in the current Internet. This paper addresses the problem of defining a realistic arrival process for the content requests generated by users, due its critical importance for both analytical and simulative evaluations of the performance of caching systems. First, with the aid of \\youtube traces collected inside operational residential networks, we identify the characteristics of real traffic that need to be considered or can be safely neglected in order to accurately predict the performance of a cache. Second, we propose a new parsimonious traffic model, named the Shot Noise Model (SNM), that enables users to natively capture the dynamics of content popularity, whilst still being sufficiently simple to be employed effectively for both analytical and scalable simulative studies of caching systems. Finally, our results show that the SNM presents a much better solution to account for the temporal locality observed in real traffic compared to existing approaches.<\/jats:p>","DOI":"10.1145\/2541468.2541470","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T14:09:19Z","timestamp":1383746959000},"page":"5-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":173,"title":["Temporal locality in today's content caching"],"prefix":"10.1145","volume":"43","author":[{"given":"Stefano","family":"Traverso","sequence":"first","affiliation":[{"name":"Politecnico di Torino, Torino, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Ahmed","sequence":"additional","affiliation":[{"name":"NEC Labs Europe, Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Garetto","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Torino, Torino, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Giaccone","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Torino, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emilio","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Torino, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saverio","family":"Niccolini","sequence":"additional","affiliation":[{"name":"NEC Labs Europe, Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,11,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193511"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2010.154"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2307636.2307649"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2011.5730523"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413193"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378960"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526749"},{"key":"e_1_2_1_9_1","volume-title":"Operating Systems Theory","author":"Coffman E.","year":"1973","unstructured":"E. Coffman and P. Denning . Operating Systems Theory . Prentice-Hall , Englewood Cliffs (NJ), 1973 . E. Coffman and P. Denning. Operating Systems Theory. Prentice-Hall, Englewood Cliffs (NJ), 1973."},{"key":"e_1_2_1_10_1","volume-title":"ITC","author":"Fricker C.","year":"2012","unstructured":"C. Fricker , P. Robert , and J. Roberts . A versatile and accurate approximation for LRU cache performance . In ITC , 2012 . C. Fricker, P. Robert, and J. Roberts. A versatile and accurate approximation for LRU cache performance. In ITC, 2012."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2010.5466667"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.104"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005722"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/382006.383200"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/580760.823760"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208696"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.029"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566874"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:2"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/98460.98525"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"e_1_2_1_22_1","volume-title":"Operating systems theory","author":"Coffman E. G.","year":"1973","unstructured":"E. G. Coffman and P. J. Denning . Operating systems theory , volume 973 . Prentice-Hall Englewood Cliffs , NJ , 1973 . E. G. Coffman and P. J. Denning. Operating systems theory, volume 973. Prentice-Hall Englewood Cliffs, NJ, 1973."},{"key":"e_1_2_1_23_1","first-page":"139","volume-title":"NTS-14","author":"Kylkoski K.","year":"1998","unstructured":"K. Kylkoski and J. Virtamo . Cache replacement algorithms for the renewal arrival model. In Fourteenth Nordic Teletraffic Seminar , NTS-14 , pages 139 -- 148 , Copenhagen, Denmark , Aug. 1998 . K. Kylkoski and J. Virtamo. Cache replacement algorithms for the renewal arrival model. In Fourteenth Nordic Teletraffic Seminar, NTS-14, pages 139--148, Copenhagen, Denmark, Aug. 1998."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2011.5772055"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398798"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935863"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339537"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433473"},{"key":"e_1_2_1_29_1","volume-title":"Shot noise Cox processes. Advances in Applied Probability, 35(3)","author":"M\u00f8ller J.","year":"2003","unstructured":"J. M\u00f8ller . Shot noise Cox processes. Advances in Applied Probability, 35(3) , 2003 . J. M\u00f8ller. Shot noise Cox processes. Advances in Applied Probability, 35(3), 2003."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803685105"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"e_1_2_1_32_1","volume-title":"Analyzing the performance of LRU caches under non-stationary traffic patterns. CoRR, abs\/1301.4909","author":"Ahmed M.","year":"2013","unstructured":"M. Ahmed , S. Traverso , P. Giaccone , E. Leonardi , and S. Niccolini . Analyzing the performance of LRU caches under non-stationary traffic patterns. CoRR, abs\/1301.4909 , 2013 . M. Ahmed, S. Traverso, P. Giaccone, E. Leonardi, and S. Niccolini. Analyzing the performance of LRU caches under non-stationary traffic patterns. CoRR, abs\/1301.4909, 2013."},{"key":"e_1_2_1_33_1","volume-title":"Simulation","author":"Ross S. M.","year":"2006","unstructured":"S. M. Ross . Simulation . Elsevier Academic Press , Amsterdam , 2006 . S. M. Ross. Simulation. Elsevier Academic Press, Amsterdam, 2006."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541468.2541470","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2541468.2541470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:35:02Z","timestamp":1750232102000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541468.2541470"}},"subtitle":["why it matters and how to model it"],"short-title":[],"issued":{"date-parts":[[2013,11,4]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,11,4]]}},"alternative-id":["10.1145\/2541468.2541470"],"URL":"https:\/\/doi.org\/10.1145\/2541468.2541470","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11,4]]},"assertion":[{"value":"2013-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}