Combining request scheduling with web caching
type: Item
instance of: scholarly article
title: Combining request scheduling with web caching
zbMATH Open document ID: 1072.68019
author: Tomás Feder
author: Rina Panigrahy
author: S. S. Seiden
author: Rob van Stee
author: An Zhu
author: Rajeev Motwani
published in: Theoretical Computer Science
publication date: 2004-11-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 2118365
zbMATH Keywords: Paging
zbMATH Keywords: Web caching
zbMATH Keywords: Request reordering
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.05.016
OpenAlex ID: W2084341200
cites work: On the influence of lookahead in competitive paging algorithms
cites work: The \(k\)-client problem
cites work: On competitive on-line paging with lookahead
cites work: An online algorithm for a problem in scheduling with set-ups and release times
cites work: On-line multi-threaded paging
cites work: Competitive paging algorithms
cites work: A strongly competitive randomized paging algorithm
DOI: 10.1016/J.TCS.2004.05.016
description: scientific article; zbMATH DE number 2118365