New results on web caching with request reordering

DOI10.1007/S00453-008-9276-XzbMATH Open1205.68507OpenAlexW1965644965MaRDI QIDQ5961978FDOQ5961978

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

online algorithmsapproximation algorithmscaching

Mathematics Subject Classification ID

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

Cites Work

• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• A strongly competitive randomized paging algorithm
• A unified approach to approximating resource allocation and scheduling
• Page replacement with multi-size pages and applications to web caching
• Combining request scheduling with web caching
• On-line restricted caching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Online file caching with rejection penalties

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)