betaFeedback

WorksMathematics

Routing Information and Stationary Limits in Many-Server Load Balancing

Abstract

We study how routing information determines stationary congestion in many-server systems with Poisson arrivals and homogeneous exponential servers. We consider policies that prioritize idle servers and select a queue stochastically no longer than a uniformly sampled queue. In nondegenerate slowdown, where spare capacity is fixed, we identify population laws from the fraction of queues with waiting jobs at each population level. We establish these laws for one-job priority, join-idle-queue, and idle-first sampling. One-job priority attains the join-the-shortest-queue population law and mean delays; further queue information can improve limiting delays in convex order without changing their means. In the super-Halfin-Whitt and Halfin-Whitt regimes, every such policy has the same stationary limits. Our estimates bound idleness-weighted occupancy tails in terms of ordinary tails, uniformly over queue-length thresholds and policies. They also yield process convergence and limit interchange for initial laws uniformly dominated by stationarity, with convergent scaled initial states.

Mathematics Subject Classification (2020): Primary 60K25; Secondary 60F17, 60J60, 90B22.

Introduction

Routing arriving jobs among parallel queues requires deciding which queue-length information to use. A dispatcher may locate idle servers, additionally identify queues with one job, or compare longer queues. For homogeneous exponential servers, the optimality properties of join-the-shortest-queue (JSQ) make it a benchmark for dispatching policies [35]. The search for policies that retain its performance with less information has led to randomized sampling [28] and join-idle-queue (JIQ) [25], among many other schemes. We ask which of these distinctions determine stationary congestion as the number of servers grows, and when policies using different information have the same limit.

When aggregate spare capacity grows on the square-root scale of the number of servers, the Halfin–Whitt diffusion limits of JIQ and JSQ agree on finite time intervals [29]. A different picture emerges in nondegenerate slowdown (NDS), where spare capacity remains fixed as the number of servers grows. Gupta and Walton [15] proved a JSQ diffusion limit and proposed approximations for JIQ and idle-one-first (I1F). JIQ uses an idle server whenever possible and otherwise routes uniformly; I1F additionally gives priority to queues containing one job. These approximations predict greater congestion under JIQ, while I1F has the same population law and mean delay as JSQ.

Their concluding discussion called for rigorous derivations of these proposed limits, steady-state limit interchange, and a systematic treatment of occupancy dynamics.

We study homogeneous parallel queues with Poisson arrivals, exponential service, and infinite buffers. Our basic routing conditions give priority to idle servers and require the chosen queue to be stochastically no longer than a uniformly selected queue, conditional on the queue state (Assumption 1). Which information matters depends on spare capacity. In the super-Halfin–Whitt and Halfin–Whitt regimes, where spare capacity grows below or on the square-root scale, idle-server information suffices: JIQ and every other policy in this class have the same scaled stationary limits as JSQ (Theorems 2 and 3). In the NDS regime, JIQ has a more congested limiting population law than JSQ, while one-job priority suffices to recover the JSQ population law and limiting mean waiting and sojourn times. We also identify the limiting stationary laws for idle-first sampling with a fixed number of samples. Once one-job priority is imposed, further information about longer queues can improve the delay distribution without changing these aggregate limits.

To compare delay distributions, we consider a policy that chooses a shortest queue whenever the minimum queue length is at most a specified threshold and uses a fixed routing rule otherwise. We call this remaining routing choice the fallback rule; uniform routing and choosing a shortest queue among a fixed number of independent uniform samples are two examples. For every fixed fallback rule in the family studied here, increasing the priority threshold beyond one job decreases limiting waiting and sojourn times in convex order while preserving their means. Thus, for every target, it reduces the expected amount by which delay exceeds that target. Every diverging priority threshold recovers the full JSQ stationary profile and delay laws when the remaining routing satisfies Assumption 1.

The mechanism behind the NDS results is the relation between queue occupancy and unused service capacity. Flow balance fixes the same mean number of idle servers for every stable policy at a given arrival rate. With service rates normalized to one, the population drift equals the number of idle servers minus spare capacity, so its average at a given population depends on the expected number of idle servers conditional on that population. In NDS, the number of idle servers remains on the scale of the fixed spare capacity even though the idle fraction vanishes. Service completions at one-job queues create idle servers, while arrivals remove idle servers whenever one is available. A larger limiting fraction of one-job queues at a given population therefore yields greater conditional mean idleness.

By filling one-job queues before extending longer queues, one-job priority produces the same limiting fraction of one-job queues, and hence the same conditional idleness, as JSQ. JIQ can instead send an arrival to a longer queue while a one-job queue remains, producing more conditional idleness at the same population level. With growing spare capacity, jobs beyond the second position become negligible on the relevant congestion scale. Routing among longer queues then disappears from the limiting population and idleness dynamics, yielding the common stationary limits.

The general NDS result formalizes this mechanism through an approximation linking the fraction of queues with waiting jobs to the total population. The approximation must remain accurate after its error is multiplied by the number of idle servers (Assumption 2). Together with the basic routing conditions, it determines the stationary population law and limiting mean delays (Theorem 1). Policies with the same limiting occupancy relation therefore have the same population law and mean delays. Under these two conditions, the limiting population is stochastically bounded below by the JSQ limit and above by the JIQ limit.

Theorem 5 controls idleness-weighted occupancy tails through ordinary tails, uniformly over queue-length thresholds and eligible policies. Proposition 3 combines these bounds with stationary idleness balance to derive the weighted approximation from ordinary occupancy convergence and ordinary queue-tail control. We verify the condition directly under one-job priority, uniformly over the eligible routing choices among longer queues. For the fixed fallback family in Example 2, which includes JIQ and idle-first sampling, we establish ordinary profile convergence and tail control and apply this criterion.

Theorem 4 gives process convergence to the corresponding diffusion in each regime on every finite time interval. The conclusion holds in stationarity and from initial laws on full queue configurations bounded by a common constant multiple of the corresponding stationary laws, provided the scaled initial observations converge in distribution. For these initial laws, taking the many-server and long-time limits in either order gives the same invariant law, including convergence of scaled population means.

Relation to earlier work. Table 1 compares the available process and stationary limits. For this comparison, let NN be the number of rate-one servers, let ΔN\Delta_N denote aggregate spare capacity, and fix β>0\beta> 0.

Routing classProcess limitStationary convergenceLimit interchange
Nondegenerate slowdown ΔN=β\Delta_N = \beta
JSQ[15]Theorem 1Theorem 4
Assumptions 1 and 2, including I1F, JIQ, and idle-first samplingTheorem 4Theorem 1Theorem 4
Super-Halfin–Whitt 1≪ΔN≪N1 \ll\Delta_N \ll\sqrt{N}
JSQ with power-law ΔN\Delta_N[38][38][38]
All policies under Assumption 1Theorem 4Theorem 2Theorem 4
Halfin–Whitt ΔN=βN\Delta_N = \beta\sqrt{N}
JSQ[12][6][6]
Idle-first sampling, including JIQ[29]Theorem 3Theorem 4
All policies under Assumption 1Theorem 4Theorem 3Theorem 4

Table 1. Process limits, convergence of finite-system stationary distributions, and limit interchange, by regime and routing class.

Following Atar’s NDS framework for pooled systems [1], Gupta and Walton [15 Section 5] identified the role of one-job queues in capacity loss and explained how information about longer queues can improve higher delay moments while preserving the limiting mean. Our NDS results establish stationary convergence to their JSQ invariant law and to the laws underlying their JIQ and I1F approximations, together with a general occupancy criterion for population limits.

In the super-Halfin–Whitt window, Liu and Ying [23] obtained stationary scaling bounds for a class of policies with finite buffers. Zhao, Banerjee, and Mukherjee [38] established the JSQ diffusion and its stationary Gamma limit under power-law spare-capacity scaling. Our common estimates extend this stationary limit to every eligible policy sequence and to arbitrary spare-capacity sequences within the window.

In the Halfin–Whitt regime [16], Eschenfeldt and Gamarnik [12] obtained the two-dimensional JSQ diffusion, and Mukherjee, Borst, van Leeuwaarden, and Whiting [29] established the same transient limit for idle-first sampling, including JIQ. Braverman [6] proved the JSQ stationary approximation and diffusion ergodicity, and later obtained convergence rates for finite buffers [7]. Our Halfin–Whitt result establishes stationary convergence and limit interchange throughout the class in Assumption 1. For ordinary shortest-of-sample routing, the coupling analysis of Mukherjee et al. [30] also gives the JSQ diffusion when the sample size grows sufficiently quickly. This sampling rule can miss idle servers outside its sample and need not satisfy our exact idle-priority condition.

At fixed subcritical load, Stolyar [32] proved that the stationary probability of waiting vanishes under pull-based routing, while Foss and Stolyar [14] obtained the same conclusion for JIQ with general service times when the load is below one half. With finite buffers and sub-Halfin–Whitt power-law scaling, Liu and Ying [22] proved vanishing stationary waiting probabilities for a policy class including JSQ and JIQ. Liu, Gong, and Ying [24] obtained analogous guarantees for Coxian-2 service times; both analyses use Stein’s method and state-space collapse. The present paper studies the more congested NDS, super-Halfin–Whitt, and Halfin–Whitt regimes, with infinite buffers and nontrivial scaled congestion limits.

Beyond the regimes studied here, Jhunjhunwala, Hurtado-Lange, and Maguluri [18] obtain a stationary exponential limit for JSQ when spare capacity is N1−αN^{1-\alpha} with α>1\alpha> 1. Banerjee, Budhiraja, and Estevez [3] obtain a rank-gap diffusion and stationary interchange for a fixed number of queues. For growing systems under extreme congestion, Banerjee, Budhiraja, and Loeser [4] obtain an infinite-dimensional rank-gap limit. These rank-gap models allow routing without exact idle priority.

The uniform estimates build on mixed workload–unused-service bounds in steady-state heavy traffic [11, 39, 17] and the idleness–congestion estimates of Liu and Ying [23]. Related moment estimates support stationary approximations for multiclass networks: Ye and Yao [37] justify interchange under moment conditions on interarrival and service times, while Braverman, Dai, and Miyazawa [9] use moment state-space collapse to control boundary-conditioned transforms under static buffer priority. The fixed-fallback profile analysis connects with Mitzenmacher’s closed-supermarket equations [28] and uses invariant-measure convergence in the spirit of Benaïm and Le Boudec [5]. Our cubic potential and product identity give tail bounds uniform over thresholds and policies, preserving the profile mean and its contribution to the population drift.

Organization. Section 2 introduces the model and presents the main results on stationary congestion, limit interchange, and customer delay. Section 3 develops the uniform stationary estimates and the methods for identifying limiting stationary laws and averaging idleness in the population dynamics. Section 4 applies these tools to prove the main results, with supporting technical proofs collected in the appendices.

Routing information and stationary performance

There are NN homogeneous single-server queues with infinite buffers. Arrivals form a Poisson process of rate λN=N−ΔN\lambda_N = N - \Delta_N, where 0<ΔN<N0 < \Delta_N < N. Service times are independent rate-one exponentials, independent of the arrival process. An arrival is routed immediately, remains at its chosen server, and receives first-come, first-served (FCFS) service. Routing probabilities depend only on the current queue-length vector and NN and are time-homogeneous. For i=1,…,Ni = 1, \ldots, N, let QiN(t)Q_i^N(t) be the number of jobs at server ii at time tt, including any job in service, and write QN(t)=(QiN(t))i=1NQ^N(t) = (Q_i^N(t))_{i=1}^N. We write QN=(QiN)i=1NQ^N = (Q_i^N)_{i=1}^N for a stationary queue-length vector and define

SN=∑i=1NQiN,IN=#{i:QiN=0},Zm,N=#{i:QiN≥m},XN=SN/N.S_N = \sum_{i=1}^{N} Q_i^N,\qquad I_N = \#\{i : Q_i^N = 0\},\qquad Z_{m,N} = \#\{i : Q_i^N \ge m\},\qquad X_N = S_N/N.

Here SNS_N is the total population, INI_N is the number of idle servers, Zm,NZ_{m,N} counts queues with at least mm jobs, and XNX_N is the population per server. The index mm ranges over the nonnegative integers N0={0,1,…}\mathbb{N}_0 = \{0,1,\ldots\}, so Z0,N=NZ_{0,N} = N and Z1,N=N−INZ_{1,N} = N - I_N. The total number of waiting jobs is WN=SN−N+INW_N = S_N - N + I_N. We write SN(t)S_N(t) and IN(t)I_N(t) for the total population and number of idle servers at time tt, with analogous notation for the other quantities. We use ℓ1\ell^1 for the space of absolutely summable sequences, with norm ∥u∥1=∑k≥1∣uk∣\lVert u\rVert_1=\sum_{k\ge1}|u_k|. The empirical tail profile of waiting jobs per queue is uN=(ukN)k≥1u^N=(u_k^N)_{k\ge1}, where ukN=Zk+1,N/Nu_k^N=Z_{k+1,N}/N and ∥uN∥1=WN/N\lVert u^N\rVert_1=W_N/N; set u0N=1u_0^N=1.

For a real number xx, write x+=max⁡{x,0}x^+=\max\{x,0\}, and for an event BB, let 1B\mathbf{1}_B denote its indicator. We write ⇒\Rightarrow for weak convergence and WpW_p for Wasserstein distance of order p≥1p\ge1, using the Euclidean metric unless another metric is stated. For a deterministic queue state q=(qi)i=1N∈N0Nq=(q_i)_{i=1}^N\in\mathbb{N}_0^N, notation such as IN(q)I_N(q) and Zm,N(q)Z_{m,N}(q) denotes the same statistics evaluated at qq. Let ι\iota denote the server selected by an arrival in that state. All routing rules satisfy the following condition.

Assumption 1 (Idle priority and comparison with uniform routing). In every queue state qq, an arrival joins an idle server whenever IN(q)>0I_N(q)>0. For every q∈N0Nq\in\mathbb{N}_0^N and every integer m≥0m\ge0,

P(qι≥m∣q)≤Zm,N(q)/N.(1)\mathbb{P}(q_\iota\ge m\mid q)\le Z_{m,N}(q)/N. \tag*{(1)}

The inequality (1) means that, conditional on the queue state, the chosen queue is stochastically no longer than a uniformly selected queue. JSQ, I1F, JIQ, and idle-first shortest-of-dd sampling with any integer d≥1d\ge1 satisfy Assumption 1. When all servers are busy, uniform routing satisfies (1) with equality. Choosing a shortest queue, or a one-job queue when one is available, selects a queue of minimum length and therefore satisfies the inequality. Choosing a shortest queue among d≥1d\ge1 independent uniform samples gives conditional probability (Zm,N(q)/N)d≤Zm,N(q)/N(Z_{m,N}(q)/N)^d\le Z_{m,N}(q)/N of selecting a queue with at least mm jobs, for every m≥0m\ge0. All these policies require locating an idle server whenever one exists. The communication needed to implement this requirement depends on how the dispatcher obtains and updates queue information.

Under Assumption 1, the queue-length process has a unique stationary law ΠN\Pi_N with finite population moments of every order for each fixed NN (Lemma 1).

Stationary limits across loading regimes

We compare stationary congestion as spare capacity increases from the NDS scale to the Halfin–Whitt scale.

The NDS regime. The spare capacity is fixed: ΔN=β>0\Delta_N=\beta>0. Flow balance gives EIN=β\mathbb{E}I_N=\beta for every policy considered here. This common average utilization leaves room for different congestion distributions because unused capacity can occur at different population levels. Since the total-population drift is IN−βI_N-\beta, the relevant quantity is E[IN∣XN]\mathbb{E}[I_N\mid X_N], the mean number of idle servers conditional on the population per server.

The fraction of queues containing at least two jobs provides the routing information needed to identify the corresponding conditional mean in the many-server limit. Let A:(1,∞)→(0,1]A:(1,\infty)\to(0,1] be a candidate approximation, fixed as NN varies. For each compact set K⊂(1,∞)K\subset(1,\infty), the integrand below is defined to be zero when XN∉KX_N\notin K.

Assumption 2 (Weighted occupancy approximation). The function AA is locally Lipschitz and, for every compact K⊂(1,∞)K\subset(1,\infty),

E[(IN+1)∣Z2,NN−A(XN)∣1{XN∈K}]⟶0.(2)\mathbb{E}\left[\left(I_N+1\right)\left|\frac{Z_{2,N}}{N}-A(X_N)\right|\mathbf{1}_{\{X_N\in K\}}\right]\longrightarrow0. \tag*{(2)}

Thus A(x)A(x) approximates the fraction of queues with waiting jobs when the population per server is xx. The factor IN+1I_N+1 requires ordinary and idleness-weighted mean errors to vanish on each compact population set, controlling the approximation in the population drift. Proposition 3 derives this weighted approximation from ordinary occupancy convergence and ordinary queue-tail control. For example, JSQ and I1F satisfy this condition with A(x)=min⁡{x−1,1}A(x)=\min\{x-1,1\}, while JIQ satisfies it with A(x)=(x−1)/xA(x)=(x-1)/x. Examples 1–4 give the resulting laws and the extension to fixed fallback rules.

Since IN/N→0I_N/N\to0, the corresponding fraction of one-job queues is 1−A(x)1-A(x). A completion at one of these queues creates an idle server, while an arrival removes an idle server whenever one exists. The normalized birth and death rates of idleness are therefore 1−A(x)1-A(x) and one, giving a geometric equilibrium with conditional mean

g(x)=1−A(x)A(x),x>1.g(x)=\frac{1-A(x)}{A(x)},\qquad x>1.

Although the idle fraction vanishes, the number of idle servers remains on the same scale as the spare capacity β\beta. Its conditional mean contributes g(x)−βg(x)-\beta to the population drift. On the time scale NtNt, the normalized arrival and service fluctuations have total variance rate two. These drift and variance coefficients lead to the candidate stationary population density and probability law

pg,β(x)=1Cg,βexp⁡{−βx+∫2xg(u) du},x>1,πg,β(dx)=pg,β(x) dx,(3)p_{g,\beta}(x)=\frac{1}{C_{g,\beta}}\exp\left\{-\beta x+\int_{2}^{x}g(u)\,\mathrm{d}u\right\},\qquad x>1,\qquad\pi_{g,\beta}(\mathrm{d}x)=p_{g,\beta}(x)\,\mathrm{d}x, \tag*{(3)}

where Cg,βC_{g,\beta} is the normalizing constant. The density pg,βp_{g,\beta} solves the stationary balance equation

pg,β′(x)={g(x)−β}pg,β(x).p'_{g,\beta}(x)=\{g(x)-\beta\}p_{g,\beta}(x).

Let TNwT_N^{\mathrm{w}} and TNsT_N^{\mathrm{s}} denote the waiting and sojourn times of a stationary arrival. For a random population X>1X>1, define the idleness variable II conditionally by

P(I=i∣X=x)=A(x){1−A(x)}i,i∈N0,\mathbb{P}(I=i\mid X=x)=A(x)\{1-A(x)\}^{i},\qquad i\in\mathbb{N}_0,

References

  1. [1]R. Atar. A diffusion regime with nondegenerate slowdown. Operations Research, 60(2):490–500, 2012. doi: 10.1287/opre.1110.1030.DOI
  2. [2]R. Atar, P. Karmakar, and D. Lipshutz. Customer-server population dynamics in heavy traffic. Stochastic Systems, 12(1):68–91, 2022. doi: 10.1287/stsy.2021.0079.DOI
  3. [3]S. Banerjee, A. Budhiraja, and B. Estevez. Load balancing in parallel queues and rank-based diffusions. Mathematics of Operations Research, 51(2):1413–1442, 2026. doi: 10.1287/moor.2023.0050.DOI
  4. [4]S. Banerjee, A. Budhiraja, and E. Loeser. Rank based routing in large server systems under extreme congestion. arXiv:2605.17677, 2026.arxiv.org/abs/2605.17677
  5. [5]M. Benaïm and J.-Y. Le Boudec. On mean field convergence and stationary regime. arXiv:1111.5710, 2011.arxiv.org/abs/1111.5710
  6. [6]A. Braverman. Steady-state analysis of the join-the-shortest-queue model in the Halfin–Whitt regime. Mathematics of Operations Research, 45(3):1069–1103, 2020. doi: 10.1287/moor.2019.1023.DOI
  7. [7]A. Braverman. The join-the-shortest-queue system in the Halfin–Whitt regime: Rates of convergence to the diffusion limit. Stochastic Systems, 13(1):1–39, 2023. doi: 10.1287/stsy.2022.0102.DOI
  8. [8]A. Braverman, J. G. Dai, and M. Miyazawa. Heavy traffic approximation for the stationary distribution of a generalized Jackson network: The BAR approach. Stochastic Systems, 7(1):143–196, 2017. doi: 10.1287/15-SSY199.DOI
  9. [9]A. Braverman, J. G. Dai, and M. Miyazawa. The BAR approach for multiclass queueing networks with SBP service policies. Stochastic Systems, 15(1):1–49, 2025. doi: 10.1287/stsy.2023.0011.DOI
  10. [10]P. Echeverría. A criterion for invariant measures of Markov processes. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 61(1):1–16, 1982. doi: 10.1007/BF00537221.
  11. [11]A. Ervilymaz and R. Srikant. Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Systems, 72(3–4):311–359, 2012. doi: 10.1007/s11134-012-9305-y.
  12. [12]P. Eschenfeldt and D. Gamarnik. Join the shortest queue with many servers. The heavy-traffic asymptotics. Mathematics of Operations Research, 43(3):867–886, 2018. doi: 10.1287/moor.2017.0887.DOI
  13. [13]S. N. Ethier and T. G. Kurtz. Markov Processes: Characterization and Convergence. John Wiley & Sons, New York, 1986. doi: 10.1002/9780470316658.DOI
  14. [14]S. Foss and A. L. Stolyar. Large-scale join-idle-queue system with general service times. Journal of Applied Probability, 54(4):995–1007, 2017. doi: 10.1017/jpr.2017.49.DOI
  15. [15]V. Gupta and N. Walton. Load balancing in the nondegenerate slowdown regime. Operations Research, 67(1):281–294, 2019. doi: 10.1287/opre.2018.1768.
  16. [16]S. Halfin and W. Whitt. Heavy-traffic limits for queues with many exponential servers. Operations Research, 29(3):567–588, 1981. doi: 10.1287/opre.29.3.567.
  17. [17]D. Hurtado-Lange and S. T. Magaluri. A load balancing system in the many-server heavy-traffic asymptotics. Queueing Systems, 101:353–391, 2022. doi: 10.1007/s11134-022-09847-7.
  18. [18]P. R. Jhunijhunwala, D. Hurtado-Lange, and S. T. Magaluri. Exponential tail bounds on queues: A confluence of non-asymptotic heavy traffic and large deviations. ACM SIGMETRICS Performance Evaluation Review, 51(4):18–19, 2024. doi: 10.1145/3649477.3649488.
  19. [19]O. Kallenberg. Foundations of Modern Probability. Springer, New York, second edition, 2002. doi: 10.1007/978-1-4757-4015-8.DOI
  20. [20]T. G. Kurtz. Averaging for martingale problems and stochastic approximation. In I. Karatzas and D. Ocone, editors, Applied Stochastic Analysis, volume 177 of Lecture Notes in Control and Information Sciences, pages 186–209. Springer, Berlin, Heidelberg, 1992. doi: 10.1007/BFb0007058.
  21. [21]J. D. C. Little. A proof for the queuing formula: L = λW. Operations Research, 9(3):383–387, 1961. doi: 10.1287/opre.9.3.383.
  22. [22]X. Liu and L. Ying. Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime. Journal of Applied Probability, 57(2):578–596, 2020. doi: 10.1017/jpr.2020.13.
  23. [23]X. Liu and L. Ying. Universal scaling of distributed queues under load balancing in the super-Halfin–Whitt regime. IEEE/ACM Transactions on Networking, 30(1):190–201, 2022. doi: 10.1109/TNET.2021.3105480.
  24. [24]X. Liu, K. Gong, and L. Ying. Steady-state analysis of load balancing with Coxian-2 distributed service times. Naval Research Logistics, 69(1):57–75, 2022. doi: 10.1002/nav.21986.
  25. [25]Y. Lu, Q. Xie, G. Kliot, A. Geller, J. R. Larus, and A. Greenberg. Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services. Performance Evaluation, 68(11):1056–1071, 2011. doi: 10.1016/j.peva.2011.07.015.
  26. [26]S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, London, 1993. doi: 10.1007/978-1-4471-3267-7.DOI
  27. [27]S. P. Meyn and R. L. Tweedie. Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes. Advances in Applied Probability, 25(3):518–548, 1993. doi: 10.2307/1427522.
  28. [28]M. Mitzenmacher. On the analysis of randomized load balancing schemes. Theory of Computing Systems, 32(3):361–386, 1999. doi: 10.1007/s002240000122.DOI
  29. [29]D. Mukherjee, S. C. Borst, J. S. H. van Leeuwaarden, and P. A. Whiting. Universality of load balancing schemes on the diffusion scale. Journal of Applied Probability, 53(4):1111–1124, 2016. doi: 10.1017/jpr.2016.68.DOI
  30. [30]D. Mukherjee, S. C. Borst, J. S. H. van Leeuwaarden, and P. A. Whiting. Universality of power-of-d load balancing in many-server systems. Stochastic Systems, 8(4):265–292, 2018. doi: 10.1287/stsy.2018.0016.DOI
  31. [31]M. Shaked and J. G. Shanthikumar. Stochastic Orders. Springer, New York, 2007. doi: 10.1007/978-0-387-34675-5.DOI
  32. [32]A. L. Stolyar. Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems, 80(4):341–361, 2015. doi: 10.1007/s11134-015-9448-8.DOI
  33. [33]C. Villani. Optimal Transport: Old and New, volume 338 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin, Heidelberg, 2009. doi: 10.1007/978-3-540-71050-9.
  34. [34]W. Whitt. Proofs of the martingale FCLT. Probability Surveys, 4:268–302, 2007. doi: 10.1214/07-PS122.DOI
  35. [35]W. Winston. Optimality of the shortest line discipline. Journal of Applied Probability, 14(1):181–189, 1977. doi: 10.2307/3213271.DOI
  36. [36]R. W. Wolff. Poisson arrivals see time averages. Operations Research, 30(2):223–231, 1982. doi: 10.1287/opre.30.2.223.DOI
  37. [37]H.-Q. Ye and D. D. Yao. Justifying diffusion approximations for multiclass queueing networks under a moment condition. The Annals of Applied Probability, 28(6):3652–3697, 2018. doi: 10.1214/18-AAP1401.DOI
  38. [38]Z. Zhao, S. Banerjee, and D. Mukherjee. Many-server asymptotics for join-the-shortest-queue in the super-Halfin–Whitt scaling window. Mathematics of Operations Research, 51(3):2073–2124, 2026. doi: 10.1287/moor.2021.0133.DOI
  39. [39]X. Zhou and N. Shroff. A note on Stein’s method for heavy-traffic analysis. arXiv:2003.06454, 2020.arxiv.org/abs/2003.06454

Paper details

vlnc:W_kpuqnryg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents