Randomized k-server algorithms for growth-rate bounded graphs

Yair Bartal; Manor Mendel

doi:10.1016/j.jalgor.2004.06.002

Randomized k-server algorithms for growth-rate bounded graphs

Yair Bartal, Manor Mendel^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

4 Scopus citations

Abstract

The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.

Original language	English
Pages (from-to)	192-202
Number of pages	11
Journal	Journal of Algorithms
Volume	55
Issue number	2
DOIs	https://doi.org/10.1016/j.jalgor.2004.06.002
State	Published - May 2005

Bibliographical note

Funding Information:
✩ A preliminary version of this work appears in Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, 2004, pp. 659–664. * Corresponding author. E-mail addresses: [email protected] (Y. Bartal), [email protected] (M. Mendel). 1 Supported in part by a grant from the Israeli Science Foundation (195/02). 2 Supported in part by the Landau Center.

Keywords

Metric embedding
Randomized algorithms
k-server problem

Access to Document

10.1016/j.jalgor.2004.06.002

Cite this

@article{d388fdf79a124dfd812801a1f6d1d779,

title = "Randomized k-server algorithms for growth-rate bounded graphs",

abstract = "The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.",

keywords = "Metric embedding, Randomized algorithms, k-server problem",

author = "Yair Bartal and Manor Mendel",

note = "Funding Information: ✩ A preliminary version of this work appears in Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, 2004, pp. 659–664. * Corresponding author. E-mail addresses: [email protected] (Y. Bartal), [email protected] (M. Mendel). 1 Supported in part by a grant from the Israeli Science Foundation (195/02). 2 Supported in part by the Landau Center.",

year = "2005",

month = may,

doi = "10.1016/j.jalgor.2004.06.002",

language = "אנגלית",

volume = "55",

pages = "192--202",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Randomized k-server algorithms for growth-rate bounded graphs

AU - Bartal, Yair

AU - Mendel, Manor

N1 - Funding Information: ✩ A preliminary version of this work appears in Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, 2004, pp. 659–664. * Corresponding author. E-mail addresses: [email protected] (Y. Bartal), [email protected] (M. Mendel). 1 Supported in part by a grant from the Israeli Science Foundation (195/02). 2 Supported in part by the Landau Center.

PY - 2005/5

Y1 - 2005/5

N2 - The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.

AB - The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.

KW - Metric embedding

KW - Randomized algorithms

KW - k-server problem

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

U2 - 10.1016/j.jalgor.2004.06.002

DO - 10.1016/j.jalgor.2004.06.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:14844365230

SN - 0196-6774

VL - 55

SP - 192

EP - 202

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 2

ER -

Randomized k-server algorithms for growth-rate bounded graphs

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this