Results 1  10
of
62,336
The Delayed kServer Problem
"... Abstract. We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a request, it must wait for one round to move again, but could serve a repeated request to the same point. We show that the delayed kserver problem is equivalent to ..."
Abstract
 Add to MetaCart
Abstract. We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a request, it must wait for one round to move again, but could serve a repeated request to the same point. We show that the delayed kserver problem is equivalent
KServer Problem
"... pace M with a distance function d (which is symmetric in most of the cases we consider). There are k servers in this space. The request sequence is oe = oe 1 oe 2 : : :, where oe i is a point in M . The online algorithm's response to oe i should be to move a server j to point oe i to serve the ..."
Abstract
 Add to MetaCart
the request. The cost measure is the total distance moved by all the servers. Example: Let M be the uniform metric space over n points. That is the metric space where the distance between every pair of points is 1. It is easy to see that the kserver problem on the uniform metric space is isomorphic
The Harmonic Algorithm for kserver Problem
"... The online kserver problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the t th request is received, one of the servers must be moved from ..."
Abstract
 Add to MetaCart
The online kserver problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the t th request is received, one of the servers must be moved from
The Kserver problem with distinguishable servers
, 1991
"... This report gives a survey of existing results in the field of online kserver algorithms and presents some new findings. The survey includes optimal online algorithms for k servers on a line or a tree, an optimal online algorithm for 2 servers in any metric space, and an optimal online algorith ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
line algorithm for n − 1 servers in a metric space with n points. The first part of the newer material pertains to the traditional kserver problem. The equivalence of the Tree and Line Potential Functions is discussed. An algorithm is given that works in any finite metric space with a competitiveness
The OnLine KServer Problem
 Computational Linguistics
, 1997
"... We survey the research performed during the last few years on the online kserver 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 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey the research performed during the last few years on the online kserver 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
A General Decomposition Theorem for the kServer Problem
 Information and Computation
, 2001
"... The first general decomposition theorem for the kserver problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k))compet ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The first general decomposition theorem for the kserver problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k
A PolylogarithmicCompetitive Algorithm for the kServer Problem
"... We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k − ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k
On Decentralized Policies for the Stochastic kServer Problem
, 2006
"... In this paper we study a dynamic resource allocation problem which we call the stochastic kserver problem. In this problem, requests for some service to be performed appear at various locations over time, and we have a collection of k mobile servers which are capable of servicing these requests. Wh ..."
Abstract
 Add to MetaCart
In this paper we study a dynamic resource allocation problem which we call the stochastic kserver problem. In this problem, requests for some service to be performed appear at various locations over time, and we have a collection of k mobile servers which are capable of servicing these requests
On online algorithms with advice for the kserver problem
 Theory of Computing Systems
, 2012
"... Abstract. We consider the model of online computation with advice [6]. In particular, we study the kserver problem under this model. We prove three upper bounds for this problem. First, we show a dlog ke b−2 competitive online algorithm for general metric spaces with b bits of advice per request, w ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. We consider the model of online computation with advice [6]. In particular, we study the kserver problem under this model. We prove three upper bounds for this problem. First, we show a dlog ke b−2 competitive online algorithm for general metric spaces with b bits of advice per request
The Distributed kServer Problem  A Competitive Distributed Translator for kServer Algorithms
, 1992
"... We consider the kserver problem [23] in a distributed setting. ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We consider the kserver problem [23] in a distributed setting.
Results 1  10
of
62,336