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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bein, W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoretical Computer Science 287(1), 387–391 (2002)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Burley, W.R.: Traversing layered graphs using the work function algorithm. Journal of Algorithms 20, 479–511 (1996)
Chrobak, M., Karloff, H., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM Journal on Discrete Mathematics 4, 172–181 (1991)
Chrobak, M., Larmore, L.L.: An optimal online algorithm for k servers on trees. SIAM Journal on Computing 20, 144–148 (1991)
Chrobak, M., Larmore, L.L.: Metrical task systems, the server problem, and the work function algorithm. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 74–94. Springer, Heidelberg (1998)
Coppersmith, D., Doyle, P.G., Raghavan, P., Snir, M.: Random walks on weighted graphs and applications to online algorithms. In: Proc. 22nd Symp. Theory of Computing (STOC), pp. 369–378. ACM, New York (1990)
Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. In: Proc. 26th Symp. Theory of Computing (STOC), pp. 507–511. ACM, New York (1994)
Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. Journal of the ACM 42, 971–983 (1995)
Koutsoupias, E., Papadimitriou, C.: The 2-evader problem. Information Processing Letters 57, 249–252 (1996)
Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for server problems. Journal of Algorithms 11, 208–230 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bein, W.W., Iwama, K., Larmore, L.L., Noga, J. (2005). The Delayed k-Server Problem. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_25
Download citation
DOI: https://doi.org/10.1007/11537311_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)