Connection caching: Model and algorithms

Journal of Computer and System Sciences

Volumn 67, Issue 1, 2003, Pages 92-126

  Cohen, Edith ^a   Kaplan, Haim ^b   Zwick, Uri ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Cache replacement; Competitive analysis; Connection caching; Marking algorithms; Online algorithms

Indexed keywords

BANDWIDTH; BUFFER STORAGE; PARALLEL ALGORITHMS; VIRTUAL REALITY;

CONNECTION CACHING;

COMPUTER SCIENCE;

EID: 0042020016     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00041-2     Document Type: Article

References (30)

1. 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-430.
2. S. Albers, Generalized connection caching, in: Proceedings of the 12th annual ACM Symposium on Parallel Algorithms and Architectures, ACM, 2000, pp. 70-78.
3. Apache HTTP server project, http://www.apache.org.
4. S. Arora, C. Lund, Hardness of approximation, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 1997, pp. 399-446.
5. L.A. Belady, A study of replacement algorithms for virtual storage computers, IBM Systems J. 5 (1966) 78-101.
6. A. Borodin, R. El Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998.
7. M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan, New results on server problems, SIAM J. Discrete Math. 4 (2) (1991) 172-181.
8. 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.
9. 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.
10. E. Cohen, H. Kaplan, U. Zwick, Connection caching, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, 1999.
11. 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-63.
12. A. Feldmann, R. Cáceres, F. Douglis, G. Glass, M. Rabinovich, Performance of Web proxy caching in heterogeneous bandwidth environments, in: Proceedings of the IEEE INFOCOM'99 Conference, 1999.
13. A. Fiat, R. Karp, M. Luby, L. McGoech, D.D. Sleator, N. Young, On competitive algorithms for paging problems, J. Algebra 12 (1991) 685-699.
14. 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'97 Conference, Cannes, France, 1997.
15. 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.
16. S. Irani, A.R. Karlin, Online computation, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, MA, 1995.
17. V. Jacobson, Congestion avoidance and control, in: Proceedings of the ACM SIGCOMM'88 Conference, 1988.
18. A.R. Karlin, M.S. Manasse, L.A. McGeoch, D.D. Sleator, Competitive snoopy caching, Algorithmica 3 (1) (1988) 70-119.
19. S. Keshav, C. Lund, S. Phillips, N. Reingold, H. Saran, An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks, J. Selected Areas Commun. 13 (1995) 1371-1382.
20. S. Keshav, H. Saran, An empirical evaluation of virtual circuit holding times policies in IP-over-ATM networks, in: Proceedings of the IEEE INFOCOM'94 Conference, 1994, http://www.cs.cornell.edu/skeshav/papers/ hold.ps.
21. 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.
22. L. McGoech, D.D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6 (1991) 816-825.
23. V.N. Padmanabhan, J.C. Mogul, Improving HTTP latency, Comput. Networks ISDN Systems 28 (1/2) (1995) 25-35.
24. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
25. 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-703.
26. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28 (2) (1985) 202-208.
27. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list updates and paging rules, Comm. ACM 28 (1985) 202-208.
28. N.E. Young, Competitive paging and dual-guided on-line weighted caching and matching algorithms, Ph.D. Thesis, Princeton University, 1991.
29. N. Young, The k-server dual and loose competitiveness for paging, Algorithmica 11 (1994) 525-541.
30. N. Young, On line file caching, in: Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1998.