{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:37:52Z","timestamp":1742387872548},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_26","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T17:14:16Z","timestamp":1194542056000},"page":"307-319","source":"Crossref","is-referenced-by-count":8,"title":["Evaluating Server-Assisted Cache Replacement in the Web"],"prefix":"10.1007","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Balachander","family":"Krishnamurthy","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"26_CR1","unstructured":"P. Cao and S. Irani, \u201cCost-aware WWW proxy caching algorithms,\u201d in Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997. http:\/\/www.cs.wisc.edu\/~cao\/papers\/gd-size.html."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"S. Irani, \u201cPage replacement with multi-size pages and applications to web caching,\u201d in Proc. 29th Annual ACM Symposium on Theory of Computing, 1997.","DOI":"10.1145\/258533.258666"},{"key":"26_CR3","unstructured":"N. Young, \u201cOn line file caching,\u201d in Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1998."},{"key":"26_CR4","unstructured":"L. Rizzo and L. Vicisano, \u201cReplacement policies for a proxy cache,\u201d tech. rep., University of Pisa, January 1998. http:\/\/www.iet.unipi.it\/~luigi\/lrv98.ps.gz."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"J. C. Mogul, \u201cHinted caching in the web,\u201d in Proceedings of the 1996 SIGOPS European Workshop, 1996. http:\/\/mosquitonet.stanford.edu\/sigops96\/papers\/mogul.ps.","DOI":"10.1145\/504450.504470"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"E. Cohen, B. Krishnamurthy, and J. Rexford, \u201cImproving end-to-end performance of the Web using server volumes and proxy filters,\u201d in Proceedings of ACM SIGCOMM, September 1998. http:\/\/www.research.att.com\/~bala\/papers\/sigcomm98.ps.gz.","DOI":"10.1145\/285243.285286"},{"key":"26_CR7","unstructured":"B. Krishnamurthy and C. E. Wills, \u201cStudy of piggyback cache validation for proxy caches in the world wide web,\u201d in Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997. http:\/\/www.research.att.com\/~bala\/papers\/pcv-usits97.ps.gz."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"B. Krishnamurthy and C. E. Wills, \u201cPiggyback server invalidation for proxy cache coherency,\u201d in Proceedings of the World Wide Web-7 Conference, April 1998. http:\/\/www.research.att.com\/~bala\/papers\/psi-www7.ps.gz.","DOI":"10.1016\/S0169-7552(98)00033-6"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. A. Belady","year":"1966","unstructured":"L. A. Belady, \u201cA study of replacement algorithms for virtual storage computers,\u201d IBM Systems Journal, vol. 5, pp. 78\u2013101, 1966.","journal-title":"IBM Systems Journal"},{"key":"26_CR10","unstructured":"S. D. Gribble and E. A. Brewer, \u201cSystem design issues for Internet middleware services: Deductions from a large client trace,\u201d in Proceedings of the USENIX. Symposium on Internet Technologies and Systems, December 1997. http:\/\/www.usenix.org\/events\/usits97."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"A. Borodin, S. Irani, P. Raghavan, and B. Schieber, \u201cCompetitive paging with locality of reference,\u201d in Proc. 23rd Annual ACM Symposium on Theory of Computing, 1991.","DOI":"10.1145\/103418.103422"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"A. Karlin, S. Phillips, and P. Raghavan, \u201cMarkov paging,\u201d in Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, IEEE, 1992.","DOI":"10.1109\/SFCS.1992.267771"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"C. Lund, N. Reingold, and S. Phillips, \u201cIP over connection oriented networks and distributional paging,\u201d in Proc. 35th IEEE Annual Symposium on Foundations of Computer Science, 1994.","DOI":"10.1109\/SFCS.1994.365674"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"S. Keshav, C. Lund, S. Phillips, N. Reingold, and H. Saran, \u201cAn empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks,\u201d Journal on Selected Areas in Communications, vol. 13, October 1995. http:\/\/www.cs.cornell.edu\/skeshav\/doc\/94\/2-16.ps.","DOI":"10.1109\/49.464709"},{"key":"26_CR15","unstructured":"A. Fiat and Z. Rosen, \u201cExperimental studies of access graph based heuristics: Beating the LRU standard?,\u201d in Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, 1997."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"A. Bestavros, \u201cUsing speculation to reduce server load and service time on the WWW,\u201d in Proceedings of the ACM 4th International Conference on Information and Knowledge Management, 1995. http:\/\/www.cs.bu.edu\/faculty\/best\/res\/papers\/Home.html.","DOI":"10.1145\/221270.221653"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/235160.235164","volume":"26","author":"V. N. Padmanabhan","year":"1996","unstructured":"V. N. Padmanabhan and J. C. Mogul, \u201cUsing predictive prefetching to improve world wide web latency,\u201d Computer Communication Review, vol. 26, no. 3, pp. 22\u201336, 1996. http:\/\/daedalus.cs.berkeley.edu\/publications\/ccr-july96.ps.gz.","journal-title":"Computer Communication Review"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:28:30Z","timestamp":1556944110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}