Artículo
Stability of JSQ in queues with general server-job class compatibilities
Fecha de publicación:
08/2020
Editorial:
Springer
Revista:
Queueing Systems
ISSN:
0257-0130
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
We consider Poisson streams of exponentially distributed jobs arriving at each edge of a hypergraph of queues. Upon arrival, an incoming job is routed to the shortest queue among the corresponding vertices. This generalizes many known models such as power-of-d load balancing and JSQ (join the shortest queue) on generic graphs. We prove that stability in this model is achieved if and only if there exists a stable static routing policy. This stability condition is equivalent to that of the JSW (join the shortest workload) policy. We show that some graph topologies lead to a loss of capacity, implying more restrictive stability conditions than in, for example, complete graphs.
Palabras clave:
HYPERGRAPH
,
JSQ LOAD BALANCING
,
STABILITY
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos (IC)
Articulos de INSTITUTO DE CALCULO
Articulos de INSTITUTO DE CALCULO
Citación
Cruise, James; Jonckheere, Matthieu Thimothy Samson; Shneer, Seva; Stability of JSQ in queues with general server-job class compatibilities; Springer; Queueing Systems; 95; 3-4; 8-2020; 271-279
Compartir
Altmétricas