The delayed k-server problem

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Bein, W. W., Iwama, K., Larmore, L. L., & Noga, J. (2005). The delayed k-server problem. In Lecture Notes in Computer Science (Vol. 3623, pp. 281–292). Springer Verlag. https://doi.org/10.1007/11537311_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free