Combining request scheduling with web caching

Theoretical Computer Science

Volumn 324, Issue 2-3 SPEC. ISS., 2004, Pages 201-218

  Feder, Tomás ^a   Motwani, Rajeev ^b   Panigrahy, Rina ^c   Seiden, Steve ^e   Van Stee, Rob ^d   Zhu, An ^b  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University   (United States)

^c CISCO SYSTEMS   (United States)

^d CWI   (Netherlands)

^e NONE

Author keywords

Paging; Request reordering; Web caching

Indexed keywords

OFFLINE CASES; REQUEST REORDERING; WEB CACHING;

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; MATHEMATICAL MODELS; SCHEDULING; VIRTUAL STORAGE; WORLD WIDE WEB;

BUFFER STORAGE;

EID: 4444304431     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.05.016     Document Type: Article

References (10)

1. Albers S. The influence of lookahead in competitive paging algorithms. Algorithmica. 18:1997;283-305.
2. Alborzi H., Torng E., Uthaisombut P., Wagner S. The. k -client problem J. Algorithms. 41:2001;115-173.
3. Breslauer D. On competitive on-line paging with lookahead. Theoret. Comput. Sci. 209(2):1998;365-375.
4. S. Divakaran, M. Saks, An online scheduling problem with job set-ups, DIMACS Technical Report, 2000.
5. Feuerstein E., Strejilevich de Loma A. On-line multi-threaded paging. Algorithmica. 32:2002;36-60.
6. Fiat A., Karp R., L.A. McGeoch M.Luby, Sleator D., Young N.E. Competitive paging algorithms. J. Algorithms. 12:1991;685-699.
7. Hoogeveen J.A. Analysis of Christofides' heuristic. Some paths are more difficult than cycles Oper. Res. Lett. 10:1978;178-193.
8. McGeoch L., Sleator D. A strongly competitive randomized paging algorithm. Algorithmica. 6(6):1991;816-825.
9. Sleator D., Tarjan R.E. Amortized efficiency of list update and paging rules. Comm. ACM. 28:1985;202-208.
10. N. Young, Competitive paging and dual-guided on-line weighted caching and matching algorithms, Ph.D. Thesis, Princeton University, 1991. Available as Computer Science Department Technical Report CS-TR-348-91.