Page replacement with multi-size pages and applications to web caching

Algorithmica (New York)

Volumn 33, Issue 3, 2002, Pages 384-409

  Irani, S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Competitive analysis; Online algorithms; Paging; Web caching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CACHE MEMORY; ONLINE SYSTEMS; RANDOM PROCESSES; TELECOMMUNICATION TRAFFIC;

COMPETITIVE ANALYSIS;

WEBSITES;

EID: 0141922702     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0125-4     Document Type: Article

References (20)

1. [AAK] S. Albers, S. Arora, and S. Khanna. Page replacement for general caching problems. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 31-40, 1999.
2. [AW] M.F. Arlitt and C.L. Williamson. Web server workload characterization: the search for invariants. Performance Evaluation Review, 24(1): 126-137, May 1996.
3. [B] L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
4. +] A. Betsavros, R. Carter, M. Crovella, C. Cunha, A. Heddaya, and S. Mirdad. Application-level document caching in the internet. Proceedings of the Second International Workshop on Services in Distributed and Networked Environments, pp. 166-173, June 1995.
5. [CI] P. Cao and S. Irani. Cost-aware www proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, pp. 193-206, 1997.
6. [CK] E. Cohen and H. Kaplan. LP-based analysis of greedy-dual size. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 879-880, 1999.
7. [DHS] P.B. Danzig, R.S. Hall, and M.F. Schwartz. A case for caching file objects inside internetworks. Proceedings of ACM Sigcomm, pp. 239-248, September 1993.
8. [F] A. Fiat. Private communication.
9. [FKIP] A. Feldman, A. Karlin, S. Irani, and S. Phillips. Private communication.
10. +] A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
11. [KMR] T.T. Kwan, R.E. McGrath, and D.A. Reed. NCSA's World Wide Web server: design and performance. IEEE Computer, 28(11):68-74, November 1995.
12. [KMRS] A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
13. [KPR] A.R. Karlin, S.J. Phillips, and P. Raghavan. Markov paging. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 208-217, 1992.
14. [LPR] C. Lund, S. Phillips, and N. Reingold. Ip over connection-oriented networks and distributional paging. Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 424-435, 1994.
15. [M] E.P. Markatos. Main memory caching of web documents. Computer Networks and ISDN Systems, 28(7-11):893-905, May 1996.
16. [ST] D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
17. [T] R.E. Tarjan. Amortized computational complexity. SIAM Journal on Discrete Mathematics, 6(2), 1985.
18. +] A. Williams, M. Abrams, C.R. Stanbridge, G. Abdulla, and E.F. Fox. Removal policies in network caches for world-wide web documents. Computer Communications Review, 26(4):293-305, October 1996.
19. [Y1] N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11:525-541, 1994.
20. [Y2] N. Young. Online file caching. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 82-86, 1998.