Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: