Competitive algorithms for server problems
Journal of Algorithms
HARMONIC is a 3–competitive for two servers
Theoretical Computer Science
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
Online computation and competitive analysis
Online computation and competitive analysis
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
A simple analysis of the harmonic algorithm for two servers
Information Processing Letters
More on random walks, electrical networks, and the harmonic k-server algorithm
Information Processing Letters
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
| Hi-index | 0.00 |
HARMONIC is a randomized algorithm for the k-server problem that, at each step, given a request point r, chooses the server to be moved to r with probability inversely proportional to the distance to r. For general k, it is known that the competitive ratio of HARMONIC is at least 1/2k(k + 1), while the best upper bound on this ratio is exponential in k. It has been conjectured that Harmonic is 1/2k(k + 1)-competitive for all k. This conjecture has been proven in a number of special cases, including k = 2 and for the so-called lazy adversary.In this paper we provide further evidence for this conjecture, by proving that HARMONIC is 6-competitive for k = 3. Our approach is based on the random walk techniques and their relationship to the electrical network theory. We propose a new potential function F and reduce the proof of the validity of 驴 to several inequalities involving hitting costs. Then we show that these inequalities hold for k = 3.