A Polylogarithmic-Competitive Algorithm for the k-Server Problem

Authors:
Nikhil Bansal;Niv Buchbinder;Aleksander Madry;Joseph (Seffi) Naor
Affiliations:
-;-;-;-
Venue:
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Year:
2011

Citing 0
Cited 3

Optimal online buffer scheduling for block devices

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A Primal-Dual Randomized Algorithm for Weighted Paging

Journal of the ACM (JACM)
A new approach to solve the k-server problem based on network flows and flow cost reduction

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give the first polylogarithmic-competitive randomized algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O~(log^3 n log^2 k) for any metric space on n points. This improves upon the (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou (J. ACM 1995) whenever n is sub-exponential in k.