Combining request scheduling with web caching
From MaRDI portal
Publication:1887085
DOI10.1016/j.tcs.2004.05.016zbMath1072.68019MaRDI QIDQ1887085
Steve Seiden, Rob van Stee, Rina Panigrahy, Tomás Feder, Rajeev Motwani, An Zhu
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
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N25: Theory of operating systems
Related Items
New results on web caching with request reordering, On the remote server problem or more about TCP acknowledgments, The tool switching problem revisited, 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