A polylogarithmic-competitive algorithm for the k-server problem

Nikhil Bansal; Niv Buchbinder; Aleksander Madry; Joseph Seffi Naor

doi:https://doi.org/10.1145/2783434

A polylogarithmic-competitive algorithm for the k-server problem

Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Seffi Naor

Tel Aviv University, Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O(log³ nlog² k) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n.

Original language	English
Article number	40
Journal	Journal of the ACM
Volume	62
Issue number	5
DOIs	https://doi.org/10.1145/2783434
State	Published - Oct 2015

Keywords

Competitive analysis
K-server problem
Randomization

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Information Systems
Hardware and Architecture
Artificial Intelligence

Access to Document

https://doi.org/10.1145/2783434

Cite this

@article{9170b65f76524a618d570b424467979b,

title = "A polylogarithmic-competitive algorithm for the k-server problem",

abstract = "We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O(log3 nlog2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n.",

keywords = "Competitive analysis, K-server problem, Randomization",

author = "Nikhil Bansal and Niv Buchbinder and Aleksander Madry and Naor, {Joseph Seffi}",

note = "Publisher Copyright: {\textcopyright} 2015 ACM 0004-5411/2015/10-ART32 15.00.",

year = "2015",

month = oct,

doi = "https://doi.org/10.1145/2783434",

language = "الإنجليزيّة",

volume = "62",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "5",

}

TY - JOUR

T1 - A polylogarithmic-competitive algorithm for the k-server problem

AU - Bansal, Nikhil

AU - Buchbinder, Niv

AU - Madry, Aleksander

AU - Naor, Joseph Seffi

PY - 2015/10

Y1 - 2015/10

N2 - We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O(log3 nlog2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n.

AB - We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O(log3 nlog2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n.

KW - Competitive analysis

KW - K-server problem

KW - Randomization

UR - http://www.scopus.com/inward/record.url?scp=84946616138&partnerID=8YFLogxK

U2 - https://doi.org/10.1145/2783434

DO - https://doi.org/10.1145/2783434

M3 - مقالة

SN - 0004-5411

VL - 62

JO - Journal of the ACM

JF - Journal of the ACM

IS - 5

M1 - 40

ER -

A polylogarithmic-competitive algorithm for the k-server problem

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this