The Infinite Server Problem

We study a variant of the k-server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a sequence of requests. In the framework of competitive analysis, we show a surprisingly tight connection between this problem and the resource augmentation version of the k-server problem, also known as the (h, k)-server problem, in Which an online algoritlun with k servers competes against an oflline algoritlun with h servers. Specifically, we show that the infinite server problem has hounded competitive ratio if and only if the (h, k)-server problem has bounded competitive ratio for some k = O(h). We give a lower bound of 3.146 for the competitive ratio of the infinite server problem, which holds even for the line and some simple weighted stars. It implies the same lower bound for the (h, k) -server problem on the line, even When k/h -> infinity, improving on the previous known bounds of 2 for the line and 2.4 for general metrics. For weighted trees and layered graphs, we obtain upper bounds, although they depend on the depth. Of particular interest is the infinite server problem on the line, which we show to be equivalent to the seemingly easier case in which all requests are in a fixed bounded interval. This is a special case of a more general reduction from arbitrary metric spaces to bounded subspaces. Unfortunately, classical approaches (double coverage and generalizations, work function algorithm, balancing algorithms) fail even for this special case.

Automated summary

We study the infinite server problem and its connection to the resource augmentation version of the k-server problem. We prove a lower bound for the competitive ratio of the infinite server problem and obtain upper bounds for weighted trees and layered graphs. The infinite server problem is shown to be equivalent to a simpler case in which all requests are in a fixed bounded interval.