The randomized server problem
type: CreativeWork
description: In the k-server problem there are k ≥ 2 identical servers which are located at k points in a metric space M. If there is a request to a point r ∈ M, one of the servers must be moved to the request point in order to "serve" this request. The cost of this service is the distance between the points where the server "resided" before the service and after the service. A k-server algorithm A must decide which server should be moved at each step. The goal of A is to minimize the total service cost. Competitiveness makes sense as a concept when A lacks timely access to all input data. We consider the version of the problem where requests must be served "online", i.e., the algorithm must decide which server to move without knowledge of future requests. Randomization is a strong tool to derive algorithms with better competitiveness; The main contributions of this thesis are: (1) An explicit detailed proof of the 2-competitiveness of the Random Slack Algorithm, which has never been given before. We note that Random Slack is a trackless algorithm. (2) An essay-style description of a new concept called the knowledge state approach, which has recently been developed by Bein, Larmore, and Reischuk. (3) We give optimally competitive randomized algorithms for 2 and 3 cache paging with few bookmarks. We note that the paging problem is a special case of the server problem, and that it is desirable to minimize the number of bookmarks, as such bookmarks pose a considerable challenge in real world applications such as cache management of pages on the world wide web; Furthermore, the thesis summarizes a number of basic results for both the randomized and the deterministic server problem.
abstract: In the k-server problem there are k ≥ 2 identical servers which are located at k points in a metric space M. If there is a request to a point r ∈ M, one of the servers must be moved to the request point in order to "serve" this request. The cost of this service is the distance between the points where the server "resided" before the service and after the service. A k-server algorithm A must decide which server should be moved at each step. The goal of A is to minimize the total service cost. Competitiveness makes sense as a concept when A lacks timely access to all input data. We consider the version of the problem where requests must be served "online", i.e., the algorithm must decide which server to move without knowledge of future requests. Randomization is a strong tool to derive algorithms with better competitiveness; The main contributions of this thesis are: (1) An explicit detailed proof of the 2-competitiveness of the Random Slack Algorithm, which has never been given before. We note that Random Slack is a trackless algorithm. (2) An essay-style description of a new concept called the knowledge state approach, which has recently been developed by Bein, Larmore, and Reischuk. (3) We give optimally competitive randomized algorithms for 2 and 3 cache paging with few bookmarks. We note that the paging problem is a special case of the server problem, and that it is desirable to minimize the number of bookmarks, as such bookmarks pose a considerable challenge in real world applications such as cache management of pages on the world wide web; Furthermore, the thesis summarizes a number of basic results for both the randomized and the deterministic server problem.
author: Zhang, Qin
language: English
date published: 2004-01-01T08:00:00Z
date modified: 2026-07-24T05:25:47Z
provider: University of Nevada - Las Vegas
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: University of Nevada, Las Vegas

PropertyValue
property ID: DOI
value: 10.25669/b3gv-na3h