Abstract
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. The paper addresses some practical aspects of the WFA, such as its efficient implementation and its true quality of serving. First, an implementation of the WFA is proposed, which is based on network flows, and which reduces each step of the WFA to only one minimal-cost maximal flow problem instance. Next, it is explained how the proposed implementation can further be simplified if the involved metric space is finite. Also, it is described how actual computing of optimal flows can be speeded up by taking into account special properties of the involved networks. Some experiments based on the proposed implementation and improvements are presented, where actual serving costs of the WFA have been measured on very large problem instances and compared with costs of other algorithms. Finally, suitability of the WFA for solving real-life problems is discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartal Y, Chrobak M, Larmor LDL (2000) A randomized algorithm for two servers on the line. Inf Comput 158: 53–69
Bartal Y, Grove E (2000) The harmonic k-server algorithm is competitive. J ACM 47: 1–15
Bartal Y, Koutsoupias E (2004) On the competitive ratio of the work function algorithm for the k-server problem. Theor Comput Sci 324: 337–345
Baumgartner A, Rudec T, Manger R (2010) The design and analysis of a modified work function algorithm for solving the on-line k-server problem. Comput Inf 29: 681–700
Bazaraa MS, Jarvis JJ, Sherali HD (2004) Linear programming and network flows, 3rd edn. Wiley-Interscience, New York
Bein W, Chrobak M, Larmore LL (2002) The 3-server problem in the plane. Theor Comput Sci 289: 335–354
Chrobak M, Karloff H, Payne TH, Vishwanathan S (1991) New results on server problems. SIAM J Discret Math 4: 172–181
Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19: 248–264
Fiat A, Rabani Y, Ravid Y, Schieber B (1994) A deterministic \({\fancyscript{O}(k)}\) -competitive k-server algorithm for the circle. Algorithmica 11: 572–578
Irani S, Karlin AR (1997) Online computation. In: Hochbaum D (eds) Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston, pp 521–564
Jungnickel D (2005) Graphs, networks and algorithms. Springer, Berlin
Koutsoupias E, Papadimitrou C (1994) On the k-server conjecture. In: Leighton FT, Goodrich M (ed) Proceedings of the 26-th annual ACM symposium on theory of computing, Montreal, Quebec, Canada, May 23–25. ACM Press, New York, pp 507–511
Koutsoupias E, Papadimitrou C (1996) The 2-evader problem. Inf Process Lett 57: 249–252
Koutsoupias E (1999) Weak adversaries for the k-server problem. In: Beame P (ed) Proceedings of the 40th annual symposium on foundations of computer science. IEEE, New York, pp 444–449
Koutsoupias E (2009) The k-server problem. Comput Sci Rev 3: 105–118
Manasse M, McGeoch LA, Sleator D (1990) Competitive algorithms for server problems. J Algorithms 11: 208–230
Rudec T, Baumgartner A, Manger R (2009) A fast implementation of the optimal off-line algorithm for solving the k-server problem. Math Commun 14: 119–134
Sleator D, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28: 202–208
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rudec, T., Baumgartner, A. & Manger, R. A fast work function algorithm for solving the k-server problem. Cent Eur J Oper Res 21, 187–205 (2013). https://doi.org/10.1007/s10100-011-0222-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-011-0222-7