Stability of JSQ in queues with general server-job class compatibilities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Queueing Systems Année : 2020

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

Résumé

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.

Dates et versions

hal-03625703 , version 1 (31-03-2022)

Identifiants

Citer

James Cruise, Matthieu Jonckheere, Seva Shneer. Stability of JSQ in queues with general server-job class compatibilities. Queueing Systems, 2020, 95 (3-4), pp.271-279. ⟨10.1007/s11134-020-09656-w⟩. ⟨hal-03625703⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More