A Simple Steady-State Analysis of Load Balancing Algorithms in the Sub-Halfin-Whitt Regime
Authors:
Open Access
- 17 January 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 46 (2) , 15-17
Abstract
This paper studies the steady-state performance of load balancing algorithms in many-server systems. We consider a system with N identical servers with buffer size b-1 such that b = o (√N), in other words, each server can hold at most b jobs, one job in service and b - 1 jobs in buffer.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Heavy-Traffic Delay Insensitivity in Connection-Level Models of Data Transfer with Proportionally Fair Bandwidth SharingACM SIGMETRICS Performance Evaluation Review, 2018
- Stein's Method for Mean Field Approximations in Light and Heavy Traffic RegimesProceedings of the ACM on Measurement and Analysis of Computing Systems, 2017
- Stein’s method for steady-state diffusion approximations of $M/\mathit{Ph}/n+M$ systemsThe Annals of Applied Probability, 2017
- Stein’s Method for Steady-state Diffusion Approximations: An Introduction through the Erlang-A and Erlang-C ModelsStochastic Systems, 2016
- On the Approximation Error of Mean-Field Models2016
- Tightness of Stationary Distributions of a Flexible-Server System in the Halfin-Whitt Asymptotic RegimeStochastic Systems, 2015
- Pull-based load distribution in large-scale heterogeneous service systemsQueueing Systems, 2015
- Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web servicesPerformance Evaluation, 2011
- Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov FunctionsThe Annals of Applied Probability, 2001
- Heavy-Traffic Limits for Queues with Many Exponential ServersOperations Research, 1981