New results on web caching with request reordering

DOI10.1007/S00453-008-9276-XMaRDI QIDQ5961978zbMATH OpenOpenAlexFDO

Authors Susanne Albers

Publication date 16 September 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9276-x

zbMATH Keywords

approximation algorithmscachingonline algorithms

Mathematics Subject Classification ID

Internet topics (68M11) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• scientific article; zbMATH DE number 2119649
• Combining request scheduling with web caching
• Page replacement with multi-size pages and applications to web caching
• scientific article; zbMATH DE number 1559590
• scientific article; zbMATH DE number 1303544

Cites work

• A strongly competitive randomized paging algorithm
• A unified approach to approximating resource allocation and scheduling
• Combining request scheduling with web caching
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• scientific article; zbMATH DE number 1303544 (Why is no real title available?)
• scientific article; zbMATH DE number 1305389 (Why is no real title available?)
• scientific article; zbMATH DE number 2119649 (Why is no real title available?)
• scientific article; zbMATH DE number 2119709 (Why is no real title available?)
• On-line restricted caching
• Page replacement with multi-size pages and applications to web caching

Cited in

(4)

• Combining request scheduling with web caching
• Online file caching with rejection penalties
• On variants of file caching
• scientific article; zbMATH DE number 2119649 (Why is no real title available?)

This page was built for publication: New results on web caching with request reordering

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