The k-resource problem on uniform and on uniformly decomposable metric spaces

Authors:
Marcin Bienkowski;Jaros Kuty
Affiliations:
Institute of Computer Science, University of Wroclaw, Poland;International Graduate School of Dynamic Intelligent Systems, and Heinz Nixdorf Institute, University of Paderborn, Germany
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 10
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Competitive paging algorithms

Journal of Algorithms
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On-line file caching

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A General Decomposition Theorem for the k-Server Problem

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On metric ramsey-type phenomena

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
Randomized k-server algorithms for growth-rate bounded graphs

Journal of Algorithms
A randomized on–line algorithm for the k–server problem on a line

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min{n, k}))-competitive randomized algorithm and an O(log(min{n, k})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource. Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min{n, k}), provided that it has some extra resources more than the optimal algorithm.