Stochastic Analysis of the $k$-Server Problem on the Circle - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Stochastic Analysis of the $k$-Server Problem on the Circle


We consider a stochastic version of the $k$-server problem in which $k$ servers move on a circle to satisfy stochastically generated requests. The requests are independent and identically distributed according to an arbitrary distribution on a circle, which is either discrete or continuous. The cost of serving a request is the distance that a server needs to move to reach the request. The goal is to minimize the steady-state expected cost induced by the requests. We study the performance of a greedy strategy, focusing, in particular, on its convergence properties and the interplay between the discrete and continuous versions of the process.
Fichier principal
Vignette du fichier
dmAM0102.pdf (146.18 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185590 , version 1 (20-08-2015)



Aris Anagnostopoulos, Clément Dombry, Nadine Guillotin-Plantard, Ioannis Kontoyiannis, Eli Upfal. Stochastic Analysis of the $k$-Server Problem on the Circle. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.21-34, ⟨10.46298/dmtcs.2791⟩. ⟨hal-01185590⟩
338 View
583 Download



Gmail Facebook X LinkedIn More