The delayed k-server problem

Authors:
Wolfgang W. Bein;Kazuo Iwama;Lawrence L. Larmore;John Noga
Affiliations:
School of Computer Science, University of Nevada, Las Vegas, Nevada;School of Informatics, Kyoto University, Kyoto, Japan;School of Computer Science, University of Nevada, Las Vegas, Nevada;Department of Computer Science, California State University Northridge, Northridge, CA
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 11
Cited 1

Competitive algorithms for server problems

Journal of Algorithms
Random walks on weighted graphs, and applications to on-line algorithms

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees

SIAM Journal on Computing
New results on server problems

SIAM Journal on Discrete Mathematics
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the k-server conjecture

Journal of the ACM (JACM)
The 2-evader problem

Information Processing Letters
Traversing layered graphs using the work function algorithm

Journal of Algorithms
Online computation and competitive analysis

Online computation and competitive analysis
The 3-server problem in the plane

Theoretical Computer Science
Metrical Task Systems, the Server Problem and the Work Function Algorithm

Developments from a June 1996 seminar on Online algorithms: the state of the art

2005: an offline persepctive

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a request, it must wait for one round to move again, but could serve a repeated request to the same point. We show that the delayed k-server problem is equivalent to the (k–1)-server problem in the uniform case, but not in general.