{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:18:16Z","timestamp":1761401896176,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319749464"},{"type":"electronic","value":"9783319749471"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74947-1_3","type":"book-chapter","created":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T13:56:04Z","timestamp":1516802164000},"page":"35-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Markov Analysis of Optimum Caching as an Equivalent Alternative to Belady\u2019s Algorithm Without Look-Ahead"],"prefix":"10.1007","author":[{"given":"Gerhard","family":"Hasslinger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,25]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Sanchez, D.: Maximizing cache performance under uncertainty. In: Proceedings of the 23rd Symposium on High Performance Computer Architecture (HPCA) (2017)","DOI":"10.1109\/HPCA.2017.43"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"2","author":"LA Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for a virtual-storage computer. IBM Syst. J. 2, 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Breslau, L., et al.: Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of the IEEE Infocom (1999)","DOI":"10.1109\/INFCOM.1999.749260"},{"issue":"7","key":"3_CR4","first-page":"1305","volume":"20","author":"H Che","year":"2002","unstructured":"Che, H., Tung, Y., Wang, Z.: Hierarchic web caching systems: modeling, design and experimental results. IEEE JSAC 20(7), 1305\u20131314 (2002)","journal-title":"IEEE JSAC"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jnca.2012.08.014","volume":"36","author":"J Famaey","year":"2013","unstructured":"Famaey, J., Iterbeke, F., Wauters, T., De Turck, F.: Towards a predictive cache replacement strategy for multimedia content. J. Netw. Comput. Appl. 36(1), 219\u2013227 (2013)","journal-title":"J. Netw. Comput. Appl."},{"key":"3_CR6","unstructured":"Gilmore, P.W.: Akamai & ISPs, Presentation UKNOF25 (2013). slideplayer.com\/slide\/10588098"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-24644-2_24","volume-title":"Languages and Compilers for Parallel Computing","author":"J Guo","year":"2004","unstructured":"Guo, J., Garzar\u00e1n, M.J., Padua, D.: The power of Belady\u2019s algorithm in register allocation for long basic blocks. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol. 2958, pp. 374\u2013389. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24644-2_24"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"3991","DOI":"10.1016\/j.comnet.2011.07.026","volume":"55","author":"G Hasslinger","year":"2011","unstructured":"Hasslinger, G., Hartleb, F.: Content delivery and caching from a network provider\u2019s perspective. Comput. Netw. 55, 3991\u20134006 (2011). Special Issue on Internet based Content Delivery","journal-title":"Comput. Netw."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-31559-1_7","volume-title":"Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems","author":"G Hasslinger","year":"2016","unstructured":"Hasslinger, G., Ntougias, K., Hasslinger, F.: Performance and precision of web caching simulations including a random generator for Zipf request pattern. In: Remke, A., Haverkort, B.R. (eds.) MMB&DFT 2016. LNCS, vol. 9629, pp. 60\u201376. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31559-1_7"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hasslinger, G., Kunbaz, M., Hasslinger, F., Bauschert, T.: Web caching evaluation from wikipedia request statistics. In: Proceedings of the 15th Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2017), Paris, France (2017)","DOI":"10.23919\/WIOPT.2017.7959873"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.comnet.2017.04.044","volume":"125","author":"G Hasslinger","year":"2017","unstructured":"Hasslinger, G., Ntougias, K., Hasslinger, F., Hohlfeld, O.: Performance evaluation for new web caching strategies combining LRU with score based object selection. Comput. Netw. 125, 172\u2013186 (2017)","journal-title":"Comput. Netw."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, C.: Back to the future: leveraging Belady\u2019s algorithm for improved cache replacement. In: Proceedings of the 43rd Annual International Symposium on Computer Architecture (ISCA) (2016)","DOI":"10.1109\/ISCA.2016.17"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0196-6774(85)90037-9","volume":"6","author":"DE Knuth","year":"1985","unstructured":"Knuth, D.E.: An analysis of optimum caching. J. Algorithms 6, 181\u2013199 (1985)","journal-title":"J. Algorithms"},{"issue":"12","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1109\/TC.2001.970573","volume":"50","author":"D Lee","year":"2001","unstructured":"Lee, D., et al.: LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Comput. 50(12), 1352\u20131361 (2001)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2004.1297303","volume":"37","author":"N Megiddo","year":"2004","unstructured":"Megiddo, N., Modha, S.: Outperforming LRU with an adaptive replacement cache algorithm. IEEE Comput. 37(4), 58\u201365 (2004)","journal-title":"IEEE Comput."},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/954339.954341","volume":"35","author":"S Podlipnik","year":"2003","unstructured":"Podlipnik, S., B\u00f6sz\u00f6rmenyi, L.: A survey of web cache replacement strategies. ACM Comput. Surv. 35(4), 374\u2013398 (2003)","journal-title":"ACM Comput. Surv."},{"key":"3_CR17","unstructured":"Shah, K., Mitra, A., Matani, D.: An O(1) algorithm for implementing the LFU cache eviction scheme. Technical report (2010).  \navailable via dhruvbird.com\/lfu.pdf or en.wikipedia.org\/wiki\/Least_frequently_used"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1137\/0205052","volume":"5","author":"AJ Smith","year":"1976","unstructured":"Smith, A.J.: Analysis of the optimal, look-ahead demand paging algorithms. SIAM J. Comput. 5(4), 743\u2013757 (1976)","journal-title":"SIAM J. Comput."},{"key":"3_CR19","unstructured":"Wikipedia statistics and information. https:\/\/meta.wikimedia.org\/wiki\/Wikimedia_servers, https:\/\/wikitech.wikimedia.org\/wiki\/Global_traffic_routing"}],"container-title":["Lecture Notes in Computer Science","Measurement, Modelling and Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74947-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:34:48Z","timestamp":1710344088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74947-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319749464","9783319749471"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74947-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Measurement, Modelling and Evaluation of Computing Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Erlangen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mmb2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mmb2018.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}