Abstract
We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources.
We give an asymptotically optimal \(\O(\log(\min\{n,k\}))\)-competitive randomized algorithm and an \(\O(\min\{k,n\})\)-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource. Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of \(\O(\log(\min\{n,k\}))\), provided that it has some extra resources more than the optimal algorithm.
Extended abstract. The full version of this paper is available online.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartal, Y., Bollobás, B., Mendel, M.: A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. In: FOCS 2001. Proc. of the 42nd IEEE Symp. on Foundations of Computer Science, pp. 396–405 (2001)
Bartal, Y., Linial, N., Mendel, M., Naor, A.: On metric Ramsey-type phenomena. In: Proc. of the 35th ACM Symp. on Theory of Computing (STOC), pp. 463–472 (2003)
Bartal, Y., Mendel, M.: Randomized k-server algorithms for growth-rate bounded graphs. Journal of Algorithms 55(2), 192–202 (2005)
Csaba, B., Lodha, S.: A randomized on-line algorithm for the k-server problem on a line. Random Structures and Algorithms 29(1), 82–104 (2006)
Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms 12(4), 685–699 (1991)
Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. Journal of the ACM 42(5), 971–983 (1995), Also appeared in Proc. of the 26th STOC, pp. 507–511 (1994)
Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of the ACM 11(2), 208–230 (1990), Also appeared as Competitive algorithms for on-line problems. In: Proc. of the 20th STOC, pp. 322–333 (1988)
Seiden, S.S.: A general decomposition theorem for the k-server problem. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 86–97. Springer, Heidelberg (2001)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Young, N.E.: On-line file caching. Algorithmica 33(3), 371–383 (2002), Also appeared in Proc. of the 9th SODA, pp. 82–86 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bienkowski, M., Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces . In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)