The Library
Stability of the greedy algorithm on the circle
Tools
Rolla, Leonardo T. and Sidoravicius, Vladas (2017) Stability of the greedy algorithm on the circle. Communications on Pure and Applied Mathematics, 70 (10). pp. 1961-1986. doi:10.1002/cpa.21712 ISSN 0010-3640.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1002/cpa.21712
Abstract
We consider a single‐server system with service stations in each point of the circle. Customers arrive after exponential times at uniformly distributed locations. The server moves at finite speed and adopts a greedy routing mechanism. It was conjectured by Coffman and Gilbert in 1987 that the service rate exceeding the arrival rate is a sufficient condition for the system to be positive recurrent, for any value of the speed. In this paper we show that the conjecture holds true.
Item Type: | Journal Article | ||||||
---|---|---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Statistics | ||||||
Journal or Publication Title: | Communications on Pure and Applied Mathematics | ||||||
Publisher: | John Wiley & Sons | ||||||
ISSN: | 0010-3640 | ||||||
Official Date: | October 2017 | ||||||
Dates: |
|
||||||
Volume: | 70 | ||||||
Number: | 10 | ||||||
Page Range: | pp. 1961-1986 | ||||||
DOI: | 10.1002/cpa.21712 | ||||||
Status: | Peer Reviewed | ||||||
Publication Status: | Published | ||||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |