Artículo

Stability of the Greedy Algorithm on the Circle

Trivellato Rolla, LeonardoIcon ; Sidoravicius, Vladas
Fecha de publicación: 10/2017
Editorial: John Wiley & Sons Inc
Revista: Communications On Pure And Applied Mathematics
ISSN: 0010-3640
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

Resumen

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.© 2017 Wiley Periodicals, Inc.
 
Archivos asociados
Thumbnail
 
Tamaño: 370.9Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/55571
URL: https://onlinelibrary.wiley.com/doi/abs/10.1002/cpa.21712
DOI: http://dx.doi.org/10.1002/cpa.21712
Colecciones
Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Citación
Trivellato Rolla, Leonardo; Sidoravicius, Vladas; Stability of the Greedy Algorithm on the Circle; John Wiley & Sons Inc; Communications On Pure And Applied Mathematics; 70; 10; 10-2017; 1961-1986
Compartir
Altmétricas