The On-Line K-Server Problem
نویسندگان
چکیده
We survey the research performed during the last few years on the on-line k-server problem over metric spaces. A variety of algorithms are presented | both deterministic and randomized | and their performance is studied in the framework of competitive analysis. Restrictions of the problem to special cases of metric spaces are also considered.
منابع مشابه
A randomized on-line algorithm for the k-server problem on a line
We give a O(n 2 3 logn)–competitive randomized k–server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k+o(k 3 2/ log k), this algorithm is o(k)–competitive.
متن کاملOn-Line Algorithms and the k-Server Conjecture
The Work Function Algorithm, a natural algorithm for the k-server problem, is shown to have competitive ratio at most 2k− 1 for all metric spaces. It is also shown that the k-server conjecture, which states that there is an on-line algorithm for the k-server problem with competitive ratio k, holds for all metric spaces with k + 2 points. Furthermore, two refinements of competitive analysis are ...
متن کاملSpeeding up the optimal off-line algorithm for solving the k-server problem
In the k-server problem [6] one has to decide how k mobile servers should serve a sequence of requests. Each server occupies a location in a fixed, possibly infinite, metric space. Repeatedly, a new request appears at some location x. To serve the request, a corresponding algorithm must move a server to x unless it already has a server at that location. Whenever the algorithm moves a server fro...
متن کامل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 (h, k)-server problem, in which an online algorithm with k servers competes against an ...
متن کاملThe influence of lookahead in competitive on-line algorithms
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997