Combining request scheduling with web caching
From MaRDI portal
Publication:1887085
DOI10.1016/j.tcs.2004.05.016zbMath1072.68019OpenAlexW2084341200MaRDI QIDQ1887085
Tomás Feder, Steve Seiden, An Zhu, Rina Panigrahy, Rob van Stee, Rajeev Motwani
Publication date: 23 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.016
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items (5)
On the remote server problem or more about TCP acknowledgments ⋮ The tool switching problem revisited ⋮ Semi-online scheduling: a survey ⋮ New results on web caching with request reordering ⋮ Resource Management in Large Networks
Cites Work
- An online algorithm for a problem in scheduling with set-ups and release times
- A strongly competitive randomized paging algorithm
- On competitive on-line paging with lookahead
- On the influence of lookahead in competitive paging algorithms
- The k-Client Problem
- Competitive paging algorithms
- On-line multi-threaded paging
This page was built for publication: Combining request scheduling with web caching
