{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:44:19Z","timestamp":1725565459394},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220565"},{"type":"electronic","value":"9783540247098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24709-8_13","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:43:48Z","timestamp":1284169428000},"page":"116-125","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Interval-Based Caching Management Scheme for Cluster Video Server"],"prefix":"10.1007","author":[{"given":"Qin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Yufu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shengli","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Andronache, V., Sha, E.H.-M., Passos, N.: Design of efficient application-specific page replacement techniques for distributed memory systems. In: Proceedings of 2000 Conference on Parallel and Distributed Computing and Systems, IASTED, pp. 551\u2013556. ACTA Press (2000)","DOI":"10.1145\/330855.331019"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/90.649565","volume":"5","author":"M.F. Arlitt","year":"1997","unstructured":"Arlitt, M.F., Williamson, C.L.: Internet web server: workload characterization and performance implications. IEEE\/ACM Transactions on Networking\u00a05(5), 631\u2013645 (1997)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13_CR3","unstructured":"Brooks, B.: Quantitative analysis in the humanities: the advantage of ranking techniques. Studies on Zipf\u2019s Law, pp. 65\u2013115 (1982)"},{"issue":"9","key":"13_CR4","first-page":"1083","volume":"26","author":"J. Choi","year":"1999","unstructured":"Choi, J., Lee, D., Noh, S.H.: Characterization and automatic detection of block reference patterns. Journal of KISS (A) (Computer Systems and Theory)\u00a026(9), 1083\u20131095 (1999)","journal-title":"Journal of KISS (A) (Computer Systems and Theory)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dan, A., Sitaram, D.: A generalized interval caching policy for mixed interactive and long video workloads. In: Proceedings of the SPIE Multimedia Computing and Networking 1996, SPIE, pp. 344\u2013351 (1996)","DOI":"10.1117\/12.235887"},{"key":"13_CR6","unstructured":"Kim, J.M., Choi, J., Kim, J.: A low-overhead, high-performance unified buffer management scheme that exploits sequential and looping reference. In: Proceedings of 4th Symposium on Operating Systems Design and Implementation (OSDI 2000), USENIX Assoc., pp.119\u2013134 (2000)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Kimbrel, T., Tomkins, A., Patterson, R.H., Bershad, B., Cao, P., Felten, E.W., Gibson, G.A., Karlin, A.R., Li, K.: A trace-driven comparison of algorithms for parallel prefetching and caching. In: Proceedings of Second USENIX Symposium on Operating Systems Design and Implementation (OSDI), Operating System Review. Special Issue, vol.\u00a030, pp. 19\u201334 (1996)","DOI":"10.1145\/238721.238737"},{"issue":"5","key":"13_CR8","first-page":"478","volume":"23","author":"J.-S. Ko","year":"1996","unstructured":"Ko, J.-S., Lee, J.-W., Yeom, H.-Y.: An alternative scheme to LRU for efficient page replacement. Journal of KISS (A) (Computer Systems and Theory)\u00a023(5), 478\u2013486 (1996)","journal-title":"Journal of KISS (A) (Computer Systems and Theory)"},{"issue":"7","key":"13_CR9","first-page":"632","volume":"24","author":"D. Lee","year":"1997","unstructured":"Lee, D., Noh, S.H., Sang, L.M.: LRFU: a block replacement policy that exploits infinite history of references. Journal of KISS (A) (Computer Systems and Theory)\u00a024(7), 632\u2013641 (1997)","journal-title":"Journal of KISS (A) (Computer Systems and Theory)"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/300515.300518","volume":"46","author":"E.J. O\u2019Neil","year":"1999","unstructured":"O\u2019Neil, E.J., O\u2019Neil, P.E., Weikum, G.: An optimality proof of the LRU-K page replacement algorithm. Journal of the ACM\u00a046(1), 92\u2013112 (1999)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24709-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T14:50:17Z","timestamp":1636469417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24709-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220565","9783540247098"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24709-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}