We consider a generalized 2-server problem in which servers have different costs. We prove that, in uniform spaces, a version of the Work Function Algorithm is 5-competitive, and that no better ratio is possible. We also give a 5-competitive randomized, memoryless algorithm for uniform spaces, and a matching lower bound. For arbitrary metric spaces, we prove that no memoryless randomized algorithm has a constant competitive ratio. We study a subproblem in which a request specifies two points to be covered by the servers, and the algorithm decides which server to move to which point; we give a 9-competitive deterministic algorithm for any metric space (no better ratio is possible).
CITATION STYLE
Chrobak, M., & Sgall, J. (2000). The weighted 2-server problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1770, pp. 593–604). Springer Verlag. https://doi.org/10.1007/3-540-46541-3_49
Mendeley helps you to discover research relevant for your work.