The weighted 2-server problem

Authors:
Marek Chrobak;Jiří Sgall
Affiliations:
Department of Computer Science, University of California, Riverside, CA;Mathematical Institute, AS CR, Žitná 25, CZ-11567 Praha 1, Czech Republic
Venue:
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Year:
2004

Citing 20
Cited 5

Competitive algorithms for server problems

Journal of Algorithms
An optimal on-line algorithm for K-servers on trees

SIAM Journal on Computing
New results on server problems

SIAM Journal on Discrete Mathematics
Shortest paths without a map

Theoretical Computer Science
On fast algorithms for two servers

Journal of Algorithms
Random walks on weighted graphs and applications to on-line algorithms

Journal of the ACM (JACM)
Searching in the plane

Information and Computation
Competitive algorithms for the weighted server problem

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
On the k-server conjecture

Journal of the ACM (JACM)
The 2-evader problem

Information Processing Letters
A polylog(n)-competitive algorithm for metrical task systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A better lower bound on the competitive ratio of the randomized 2-server problem

Information Processing Letters
Online computation and competitive analysis

Online computation and competitive analysis
The harmonic k-server algorithm is competitive

Journal of the ACM (JACM)
Competitive analysis of randomized paging algorithms

Theoretical Computer Science
A randomized algorithm for two servers on the line

Information and Computation
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems

SIAM Journal on Computing
Metrical Task Systems, the Server Problem and the Work Function Algorithm

Developments from a June 1996 seminar on Online algorithms: the state of the art
More on weighted servers or FIFO is better than LRU

Theoretical Computer Science
A competitive algorithm for the general 2-server problem

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

The generalized two-server problem

Journal of the ACM (JACM)
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem

Theoretical Computer Science
Online chasing problems for regular polygons

Information Processing Letters
The k-server problem

Computer Science Review
On the on-line weighted k-taxi problem

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a generalization of the 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, in contrast with the non-weighted case, we prove that there is no memoryless randomized algorithm with finite competitive ratio. We also propose a version of the problem in which a request specifies two points to be covered by the servers, and the algorithm must decide which server to move to which point. For this version, we show a 9-competitive algorithm and we prove that no better ratio is possible.