New results on web caching with request reordering

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 84-92

  Albers, Susanne ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Approximation; Batch; Cache; Competitive; Document; Offline; Online

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CACHE MEMORY; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; POLYNOMIALS;

ONLINE ALGORITHMS; POLYNOMIAL TIME ALGORITHMS; REQUEST REORDERING; WEB CACHING;

WORLD WIDE WEB;

EID: 8344284222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007925     Document Type: Conference Paper

References (14)

1. D. Achlioptas, M. Chrobak and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203-218, 2000.
2. S. Albers, S. Arora and S. Khanna. Page replacement for general caching problems. Proc. 10th Annual ACM-SIAM Symposium Discrete Algorithms, 31-40, 1999.
3. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48:1069-1090, 2001.
4. L. A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
5. P. Cao and S. Irani. Cost-aware WWW proxy caching algorithms. Proc. USENIX Symposium on Internet Technology and Systems, 193-206, 1997.
6. T. Feder, R. Motwani, R. Panigrahy and A. Zhu. Web caching with request reordering. Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
7. T. Feder, R. Motwani, R. Panigrahy, S. Seiden, R. van Stee and A. Zhu. Combining request scheduling with web caching. Extended version of [6], to appear in Theoretical Computer Science.
8. A. Feldmann, A. Karlin, S. Irani and S. Phillips. Private communication, transmitted through [11], 1996.
9. A. Fiat, R.M. Karp, L.A. McGeoch, D.D. Sleator and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
10. P. Gopalan, H.J. Karloff, A. Mehta, M. Mihail and N. Vishnoi. Caching with expiration times. Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 540-547, 2002.
11. S. Irani. Page replacement with multi-size pages and applications to Web caching. Proc. 29th Annual ACM Symposium on Theory of Computing, 701-710, 1997.
12. L.A. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816-825, 1991.
13. D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652-686, 1985.
14. N.E. Young. Online file caching. Proc. 9th Annual ACMSIAM Symposium on Discrete Algorithms, 82-86, 1998.