Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
From MaRDI portal
Publication:5358490
DOI10.1109/TCNS.2015.2428331zbMath1370.90091OpenAlexW2312281960MaRDI QIDQ5358490
Ravi R. Mazumdar, Arpan Mukhopadhyay
Publication date: 21 September 2017
Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcns.2015.2428331
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Choosing among heterogeneous server clouds ⋮ Near equilibrium fluctuations for supermarket models with growing choices ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Mean field approximations to a queueing system with threshold-based workload control scheme ⋮ Insensitivity of the mean field limit of loss systems under SQ(d) routeing ⋮ Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems ⋮ Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach ⋮ The hydrodynamic limit of a randomized load balancing network ⋮ A general ``power-of-\(d\) dispatching framework for heterogeneous systems
