Stability of JSQ in queues with general server-job class compatibilities

Autores
Cruise, James; Jonckheere, Matthieu Thimothy Samson; Shneer, Seva
Año de publicación
2020
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil: Cruise, James. Heriot-watt University; Reino Unido
Fil: Jonckheere, Matthieu Thimothy Samson. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Shneer, Seva. Heriot-watt University; Reino Unido
Materia
HYPERGRAPH
JSQ LOAD BALANCING
STABILITY
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/143232
Acceder
id CONICETDig_bc31e3bda8ff0aba3383c4c1344c9e60
oai_identifier_str oai:ri.conicet.gov.ar:11336/143232
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Stability of JSQ in queues with general server-job class compatibilitiesCruise, JamesJonckheere, Matthieu Thimothy SamsonShneer, SevaHYPERGRAPHJSQ LOAD BALANCINGSTABILITYhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1We 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.Fil: Cruise, James. Heriot-watt University; Reino UnidoFil: Jonckheere, Matthieu Thimothy Samson. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Shneer, Seva. Heriot-watt University; Reino UnidoSpringer2020-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/143232Cruise, 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-2790257-0130CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://link.springer.com/10.1007/s11134-020-09656-winfo:eu-repo/semantics/altIdentifier/doi/10.1007/s11134-020-09656-winfo:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/2001.09921v2info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:48:56Zoai:ri.conicet.gov.ar:11336/143232instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:48:57.163CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Stability of JSQ in queues with general server-job class compatibilities
title Stability of JSQ in queues with general server-job class compatibilities
spellingShingle Stability of JSQ in queues with general server-job class compatibilities
Cruise, James
HYPERGRAPH
JSQ LOAD BALANCING
STABILITY
title_short Stability of JSQ in queues with general server-job class compatibilities
title_full Stability of JSQ in queues with general server-job class compatibilities
title_fullStr Stability of JSQ in queues with general server-job class compatibilities
title_full_unstemmed Stability of JSQ in queues with general server-job class compatibilities
title_sort Stability of JSQ in queues with general server-job class compatibilities
dc.creator.none.fl_str_mv Cruise, James
Jonckheere, Matthieu Thimothy Samson
Shneer, Seva
author Cruise, James
author_facet Cruise, James
Jonckheere, Matthieu Thimothy Samson
Shneer, Seva
author_role author
author2 Jonckheere, Matthieu Thimothy Samson
Shneer, Seva
author2_role author
author
dc.subject.none.fl_str_mv HYPERGRAPH
JSQ LOAD BALANCING
STABILITY
topic HYPERGRAPH
JSQ LOAD BALANCING
STABILITY
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Cruise, James. Heriot-watt University; Reino Unido
Fil: Jonckheere, Matthieu Thimothy Samson. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Shneer, Seva. Heriot-watt University; Reino Unido
description 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.
publishDate 2020
dc.date.none.fl_str_mv 2020-08
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/143232
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
0257-0130
CONICET Digital
CONICET
url http://hdl.handle.net/11336/143232
identifier_str_mv 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
0257-0130
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://link.springer.com/10.1007/s11134-020-09656-w
info:eu-repo/semantics/altIdentifier/doi/10.1007/s11134-020-09656-w
info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/2001.09921v2
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842268946555731968
score 13.13397

Publicaciones similares