Combining request scheduling with web caching

DOI10.1016/J.TCS.2004.05.016MaRDI QIDQ1887085zbMATH OpenOpenAlexFDO

Authors Tomás Feder, Rina Panigrahy, S. S. Seiden, Rob van Stee, An Zhu, 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

zbMATH Keywords

PagingWeb cachingRequest reordering

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• New results on web caching with request reordering
• scientific article; zbMATH DE number 2119649
• scientific article; zbMATH DE number 1559590
• Page replacement with multi-size pages and applications to web caching
• scientific article; zbMATH DE number 1305389

Cites work

• A strongly competitive randomized paging algorithm
• An online algorithm for a problem in scheduling with set-ups and release times
• Competitive paging algorithms
• On competitive on-line paging with lookahead
• On the influence of lookahead in competitive paging algorithms
• On-line multi-threaded paging
• The \(k\)-client problem

Cited in

(7)

• On the remote server problem or more about TCP acknowledgments
• Resource Management in Large Networks
• scientific article; zbMATH DE number 2119649 (Why is no real title available?)
• scientific article; zbMATH DE number 2088487 (Why is no real title available?)
• The tool switching problem revisited
• Semi-online scheduling: a survey
• New results on web caching with request reordering

This page was built for publication: Combining request scheduling with web caching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887085)