{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T02:52:55Z","timestamp":1673319175632},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0022-0000(03)00041-2","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T23:51:31Z","timestamp":1054079491000},"page":"92-126","source":"Crossref","is-referenced-by-count":3,"title":["Connection caching: model and algorithms"],"prefix":"10.1016","volume":"67","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00041-2_BIB1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, M. Chrobak, J. Noga, Competitive analysis of randomized paging algorithms, in: Proceedings of the Fourth European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, 1996, pp. 419\u2013430.","DOI":"10.1007\/3-540-61680-2_72"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB2","doi-asserted-by":"crossref","unstructured":"S. Albers, Generalized connection caching, in: Proceedings of the 12th annual ACM Symposium on Parallel Algorithms and Architectures, ACM, 2000, pp. 70\u201378.","DOI":"10.1145\/341800.341810"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB3","unstructured":"Apache HTTP server project, http:\/\/www.apache.org."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB4","series-title":"Approximation Algorithms for NP-hard Problems","first-page":"399","article-title":"Hardness of approximation","author":"Arora","year":"1997"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","article-title":"A study of replacement algorithms for virtual storage computers","volume":"5","author":"Belady","year":"1966","journal-title":"IBM Systems J."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB6","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"issue":"2","key":"10.1016\/S0022-0000(03)00041-2_BIB7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","article-title":"New results on server problems","volume":"4","author":"Chrobak","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB8","unstructured":"E. Cohen, H. Kaplan, LP-based analysis of greedy-dual-size, in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1999, full version in submission."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB9","unstructured":"E. Cohen, H. Kaplan, J.D. Oldham, Policies for managing TCP connections under persistent HTTP, in: Proceedings of the World Wide Web-8 Conference, 1999."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB10","doi-asserted-by":"crossref","unstructured":"E. Cohen, H. Kaplan, U. Zwick, Connection caching, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, 1999.","DOI":"10.1145\/301250.301416"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB11","doi-asserted-by":"crossref","unstructured":"E. Cohen, H. Kaplan, U. Zwick, Competitive connection caching under various models of communication, in: Proceedings of the 12th annual ACM Symposium on Parallel Algorithms and Architectures, 2000, pp. 54\u201363.","DOI":"10.1145\/341800.341808"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB12","doi-asserted-by":"crossref","unstructured":"A. Feldmann, R. C\u00e1ceres, F. Douglis, G. Glass, M. Rabinovich, Performance of Web proxy caching in heterogeneous bandwidth environments, in: Proceedings of the IEEE INFOCOM\u201999 Conference, 1999.","DOI":"10.1109\/INFCOM.1999.749258"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB13","first-page":"685","article-title":"On competitive algorithms for paging problems","volume":"12","author":"Fiat","year":"1991","journal-title":"J. Algebra"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB14","doi-asserted-by":"crossref","unstructured":"H. Frystyk Nielsen, J. Gettys, A. Baird-Smith, E. Prud'hommeaux, H.W. Lie, C. Lilley, Network performance effects of HTTP\/1.1, CSS1, and PNG, in: Proceedings of the ACM SIGCOMM\u201997 Conference, Cannes, France, 1997.","DOI":"10.1145\/263105.263157"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB15","doi-asserted-by":"crossref","unstructured":"S. Irani, Page replacement with multi-size pages and applications to web caching, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, 1997.","DOI":"10.1145\/258533.258666"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB16","series-title":"Approximation Algorithms for NP-hard Problems","article-title":"Online computation","author":"Irani","year":"1995"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB17","doi-asserted-by":"crossref","unstructured":"V. Jacobson, Congestion avoidance and control, in: Proceedings of the ACM SIGCOMM\u201988 Conference, 1988.","DOI":"10.1145\/52324.52356"},{"issue":"1","key":"10.1016\/S0022-0000(03)00041-2_BIB18","first-page":"70","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB19","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/49.464709","article-title":"An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks","volume":"13","author":"Keshav","year":"1995","journal-title":"J. Selected Areas Commun."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB20","unstructured":"S. Keshav, H. Saran, An empirical evaluation of virtual circuit holding times policies in IP-over-ATM networks, in: Proceedings of the IEEE INFOCOM\u201994 Conference, 1994, http:\/\/www.cs.cornell.edu\/skeshav\/papers\/hold.ps."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB21","doi-asserted-by":"crossref","unstructured":"C. Lund, N. Reingold, S. Phillips, IP over connection oriented networks and distributional paging, in: Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, IEEE, 1994, http:\/\/www.cs.cornell.edu\/skeshav\/doc\/94\/2-16.ps.","DOI":"10.1109\/SFCS.1994.365674"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB22","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","article-title":"A strongly competitive randomized paging algorithm","volume":"6","author":"McGoech","year":"1991","journal-title":"Algorithmica"},{"issue":"1\/2","key":"10.1016\/S0022-0000(03)00041-2_BIB23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(95)00106-1","article-title":"Improving HTTP latency","volume":"28","author":"Padmanabhan","year":"1995","journal-title":"Comput. Networks ISDN Systems"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB24","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB25","doi-asserted-by":"crossref","unstructured":"P. Raghavana, M. Snir, Memory versus randomization in on-line algorithms. Proceedings of the 16th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin, 1989, pp. 687\u2013703.","DOI":"10.1007\/BFb0035792"},{"issue":"2","key":"10.1016\/S0022-0000(03)00041-2_BIB26","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB27","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list updates and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB28","unstructured":"N.E. Young, Competitive paging and dual-guided on-line weighted caching and matching algorithms, Ph.D. Thesis, Princeton University, 1991."},{"key":"10.1016\/S0022-0000(03)00041-2_BIB29","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/BF01189992","article-title":"The k-server dual and loose competitiveness for paging","volume":"11","author":"Young","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(03)00041-2_BIB30","unstructured":"N. Young, On line file caching, in: Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1998."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000412?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000412?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:31:36Z","timestamp":1584689496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0022000003000412"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00041-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}