Stability of JSQ in queues with general server-job class compatibilities
Probability
2020-03-11 v2
Abstract
We consider Poisson streams of exponentially distributed jobs arriving at each edge of a hypergraph of queues. Upon arrival, an incoming job is rooted 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 provide a generic condition for stability of this model. We show that some graph topologies lead to a loss of capacity, implying more restrictive stability conditions than in, e.g., complete graphs.
Keywords
Cite
@article{arxiv.2001.09921,
title = {Stability of JSQ in queues with general server-job class compatibilities},
author = {James Cruise and Matthieu Jonckheere and Seva Shneer},
journal= {arXiv preprint arXiv:2001.09921},
year = {2020}
}