Competitive k-server algorithms
نویسندگان
چکیده
منابع مشابه
Competitive k-Server Algorithms
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3-server randomized competitive algorithm [BKT] and a non-constructive proof that a deterministic 3-server competitive algorithm exists [BBKTW]. The competitive ratio ...
متن کاملThe Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms
We consider the k-server problem [23] in a distributed setting. Given a network of n processors, and k identical mobile servers, requests for service appear at the processors and a server must reach the request-point. Besides modeling problems in computer networks where k identical mobile resources are shared by the processors of the network, this models a realistic situation where the transfer...
متن کاملCompetitive Algorithms for Generalized k-Server in Uniform Metrics
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server si lies in its own metric space Mi. A request is a k-tuple r = (r1, r2, . . . , rk) and to serve it, we need to move some server si to the point ri ∈ Mi, and the goal is to minimize the total distance traveled by the servers. Despite much work, no f(k)-competitive al...
متن کاملCompetitive Algorithms for Server Problems
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph under a sequence of requests for service. Each request consists of the name of a vertex, and is satisfied by placing a server at the requested vertex. The requests must be satisfied in their order of occurrence. The cost of satisfying a sequence of requests is the distance moved by the servers. In...
متن کاملCompetitive Algorithms for the Weighted Server Problem
Fiat, A. and M. Ricklin, Competitive algorithms for the weighted server problem, Theoretical Computer Science 130 (1994) 85-99. In this paper we deal with a generalization of the k-server problem (Manasse et al. 1988) in which the servers are unequal. In the weighted server mode1 each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80060-1