Randomized k-server on hierarchical binary trees

Authors:
Aaron Coté;Adam Meyerson;Laura Poplawski
Affiliations:
University of California, Los Angeles, Los Angeles, CA, USA;University of California, Los Angeles, Los Angeles, CA, USA;Northeastern University, Boston, MA, USA
Venue:
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Year:
2008

Citing 18
Cited 7

Competitive algorithms for server problems

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

SIAM Journal on Computing
Competitive paging algorithms

Journal of Algorithms
HARMONIC is a 3–competitive for two servers

Theoretical Computer Science
On the k-server conjecture

Journal of the ACM (JACM)
A polylog(n)-competitive algorithm for metrical task systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Unfair problems and randomized algorithms for metrical task systems

Information and Computation
New results on server problems

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A simple analysis of the harmonic algorithm for two servers

Information Processing Letters
A tight bound on approximating arbitrary metrics by tree metrics

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Weak Adversaries for the k-Server Problem

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A Ramsey-Type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Better Algorithms for Unfair Metrical Task Systems and Applications

SIAM Journal on Computing
Randomized k-server algorithms for growth-rate bounded graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive k-server algorithms

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A decomposition theorem and bounds for randomized server problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Distributed resource management and matching in sensor networks

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Towards the randomized k-server conjecture: a primal-dual approach

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metrical task systems and the k-server problem on HSTs

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The k-server problem

Computer Science Review
A Primal-Dual Randomized Algorithm for Weighted Paging

Journal of the ACM (JACM)
The k-resource problem in uniform metric spaces

Theoretical Computer Science
Online optimization with switching cost

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design a randomized online algorithm for k-server on binary trees with hierarchical edge lengths, with expected competitive ratio O(log Delta), where Delta is the diameter of the metric. This is one of the first k-server algorithms with competitive ratio poly-logarithmic in the natural problem parameters, and represents substantial progress on the randomized k-server conjecture. Extending the algorithm to trees of higher degree would give a competitive ratio of O(log2 Delta log n) for the k-server problem on general metrics with n points and diameter Delta.