{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:59:54Z","timestamp":1778741994691,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T00:00:00Z","timestamp":1499990400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T00:00:00Z","timestamp":1499990400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA_9550_15_1_0183"],"award-info":[{"award-number":["FA_9550_15_1_0183"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11134-017-9540-3","type":"journal-article","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T14:19:34Z","timestamp":1500041974000},"page":"207-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal timer-based caching policies for general arrival processes"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0134-5548","authenticated-orcid":false,"given":"Andres","family":"Ferragut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismael","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paganini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"issue":"1","key":"9540_CR1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s11134-009-9141-x","volume":"63","author":"S Aalto","year":"2009","unstructured":"Aalto, S., Ayesta, U., Righter, R.: On the Gittins index in the M\/G\/1 queue. Queueing Syst. 63(1), 437\u2013458 (2009)","journal-title":"Queueing Syst."},{"issue":"7","key":"9540_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MCOM.2012.6231276","volume":"50","author":"B Ahlgren","year":"2012","unstructured":"Ahlgren, B., Dannewitz, C., Imbrenda, C., Kutscher, D., Ohlman, B.: A survey of information-centric networking. IEEE Commun. Mag. 50(7), 26\u201336 (2012)","journal-title":"IEEE Commun. Mag."},{"key":"9540_CR3","volume-title":"Elements of Queueing Theory","author":"F Baccelli","year":"2013","unstructured":"Baccelli, F., Bremaud, P.: Elements of Queueing Theory. Springer-Verlag, Berlin (2013)"},{"issue":"1","key":"9540_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.peva.2005.07.015","volume":"62","author":"O Bahat","year":"2005","unstructured":"Bahat, O., Makowski, A.M.: Measuring consistency in TTL-based caches. Perform. Eval. 62(1), 439\u2013455 (2005)","journal-title":"Perform. Eval."},{"issue":"2","key":"9540_CR5","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1214\/09-AAP635","volume":"20","author":"J Barrera","year":"2010","unstructured":"Barrera, J., Fontbona, J.: The limiting move-to-front search-cost in law of large numbers asymptotic regimes. Ann. Appl. Probab. 20(2), 722\u2013752 (2010)","journal-title":"Ann. Appl. Probab."},{"key":"9540_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.peva.2014.07.001","volume":"79","author":"DS Berger","year":"2014","unstructured":"Berger, D.S., Gland, P., Singla, S., Ciucu, F.: Exact analysis of TTL cache networks. Perform. Eval. 79, 2\u201323 (2014)","journal-title":"Perform. Eval."},{"issue":"2","key":"9540_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/2825236.2825259","volume":"43","author":"DS Berger","year":"2015","unstructured":"Berger, D.S., Henningsen, S., Ciucu, F., Schmitt, J.B.: Maximizing cache hit ratios by variance reduction. ACM SIGMETRICS Perform. Eval. Rev. 43(2), 57\u201359 (2015)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"3","key":"9540_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/2500098.2500106","volume":"43","author":"G Bianchi","year":"2013","unstructured":"Bianchi, G., Detti, A., Caponi, A., Blefari Melazzi, N.: Check before storing: what is the performance price of content integrity verification in LRU caching? ACM SIGCOMM Comput. Commun. Rev. 43(3), 59\u201367 (2013)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"9540_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)"},{"key":"9540_CR10","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of IEEE\/Infocom, pp. 126\u2013134 (1999)","DOI":"10.1109\/INFCOM.1999.749260"},{"issue":"7","key":"9540_CR11","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/JSAC.2002.801752","volume":"20","author":"H Che","year":"2002","unstructured":"Che, H., Tung, Y., Wang, Z.: Hierarchical web caching systems: modeling, design and experimental results. IEEE J. Sel. Areas Commun. 20(7), 1305\u20131314 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9540_CR12","doi-asserted-by":"crossref","unstructured":"Dan, A., Towsley, D.: An approximate analysis of the LRU and FIFO buffer replacement schemes. In: Proceedings of ACM\/SIGMETRICS, pp. 143\u2013152 (1990)","DOI":"10.1145\/98460.98525"},{"key":"9540_CR13","doi-asserted-by":"crossref","unstructured":"Dehghan, M., Massouli\u00e9, L., Towsley, D., Menasche, D., Tay, Y.C.: A utility optimization approach to network cache design. In: Proceedings of IEEE\/Infocom, pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524445"},{"key":"9540_CR14","doi-asserted-by":"crossref","unstructured":"Ferragut, A., Rodriguez, I., Paganini, F.: Optimizing TTL caches under heavy tailed demands. In: Proceedings of ACM\/SIGMETRICS, pp. 101\u2013112 (2016)","DOI":"10.1145\/2964791.2901459"},{"issue":"1","key":"9540_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-3975(95)00210-3","volume":"164","author":"JA Fill","year":"1996","unstructured":"Fill, J.A.: Limits and rates of convergence for the distribution of search cost under the move-to-front rule. Theor. Comput. Sci. 164(1), 185\u2013206 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9540_CR16","unstructured":"Fofack, N.C., Nain, P., Neglia, G., Towsley, D.: Analysis of TTL-based cache networks. In: Proceedings of Intl. Conf on Performance Evaluation Methodologies and Tools (VALUETOOLS), pp. 1\u201310 (2012)"},{"key":"9540_CR17","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.comnet.2014.03.006","volume":"65","author":"NC Fofack","year":"2014","unstructured":"Fofack, N.C., Nain, P., Neglia, G., Towsley, D.: Performance evaluation of hierarchical TTL-based cache networks. Comput. Netw. 65, 212\u2013231 (2014)","journal-title":"Comput. Netw."},{"key":"9540_CR18","unstructured":"Fricker, C., Robert, P., Roberts, J.: A versatile and accurate approximation for LRU cache performance. In: Proceedings of the 24th International Teletraffic Congress, pp. 57\u201364 (2012)"},{"key":"9540_CR19","doi-asserted-by":"crossref","unstructured":"Gast, N., Houdt, B.V.: Transient and steady-state regime of a family of list-based cache replacement algorithms. In: Proceedings of ACM\/SIGMETRICS, pp. 123\u2013136 (2015)","DOI":"10.1145\/2796314.2745850"},{"issue":"6","key":"9540_CR20","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/TC.1973.5009115","volume":"100","author":"E Gelenbe","year":"1973","unstructured":"Gelenbe, E.: A unified approach to the evaluation of a class of replacement algorithms. IEEE Trans. Comput. 100(6), 611\u2013618 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"9540_CR21","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014)"},{"key":"9540_CR22","doi-asserted-by":"crossref","unstructured":"Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: Proceedings of the ACM\/Conext, pp. 1\u201312 (2009)","DOI":"10.1145\/1658939.1658941"},{"key":"9540_CR23","doi-asserted-by":"crossref","unstructured":"Jelenkovi\u0107, P., Radovanovi\u0107, A.: Asymptotic insensitivity of least-recently-used caching to statistical dependency. In: Proceedings of IEEE\/Infocom, pp. 438\u2013447 (2003)","DOI":"10.1109\/INFCOM.2003.1208695"},{"issue":"2","key":"9540_CR24","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1214\/aoap\/1029962750","volume":"9","author":"PR Jelenkovi\u0107","year":"1999","unstructured":"Jelenkovi\u0107, P.R.: Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities. Ann. Appl. Probab. 9(2), 430\u2013464 (1999)","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"9540_CR25","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2004.07.029","volume":"326","author":"PR Jelenkovi\u0107","year":"2004","unstructured":"Jelenkovi\u0107, P.R., Radovanovi\u0107, A.: Least-recently-used caching with dependent requests. Theor. Comput. Sci. 326(1), 293\u2013327 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9540_CR26","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/rsa.20214","volume":"33","author":"PR Jelenkovi\u0107","year":"2008","unstructured":"Jelenkovi\u0107, P.R., Radovanovi\u0107, A.: The persistent-access-caching algorithm. Random Struct. Algorithms 33(2), 219\u2013251 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"9540_CR27","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1239\/jap\/1165505204","volume":"43","author":"PR Jelenkovi\u0107","year":"2006","unstructured":"Jelenkovi\u0107, P.R., Radovanovi\u0107, A., Squillante, M.S.: Critical sizing of LRU caches with dependent requests. J. Appl. Probab. 43(4), 1013\u20131027 (2006)","journal-title":"J. Appl. Probab."},{"key":"9540_CR28","doi-asserted-by":"crossref","unstructured":"Jung, J., Berger, A.W., Balakrishnan, H.: Modeling TTL-based internet caches. In: Proceedings of IEEE\/Infocom, pp. 417\u2013426 (2003)","DOI":"10.1109\/INFCOM.2003.1208693"},{"key":"9540_CR29","unstructured":"King, W.: Analysis of paging algorithms. In: Proceedings of IFIP Congress, pp. 485\u2013490 (1971)"},{"key":"9540_CR30","doi-asserted-by":"crossref","unstructured":"Martina, V., Garetto, M., Leonardi, E.: A unified approach to the performance analysis of caching systems. In: Proceedings of IEEE\/Infocom, pp. 2040\u20132048 (2014)","DOI":"10.1109\/INFOCOM.2014.6848145"},{"key":"9540_CR31","unstructured":"Osipova, N., Ayesta, U., Avrachenkov, K.: Optimal policy for multi-class scheduling in a single server queue. In: Proceedings of 21st International Teletraffic Congress (ITC), pp. 1\u20138 (2009)"},{"key":"9540_CR32","doi-asserted-by":"crossref","unstructured":"Rosensweig, E.J., Kurose, J., Towsley, D.: Approximate models for general cache networks. In: Proceedings of IEEE\/Infocom, pp. 1\u20139 (2010)","DOI":"10.1109\/INFCOM.2010.5461936"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-017-9540-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-017-9540-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-017-9540-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T21:28:35Z","timestamp":1750627715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-017-9540-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,14]]},"references-count":32,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9540"],"URL":"https:\/\/doi.org\/10.1007\/s11134-017-9540-3","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,14]]},"assertion":[{"value":"9 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}