Heavy traffic approximation explained

In queueing theory, a discipline within the mathematical theory of probability, a heavy traffic approximation (sometimes called heavy traffic limit theorem^[1] or diffusion approximation) involves the matching of a queueing model with a diffusion process under some limiting conditions on the model's parameters. The first such result was published by John Kingman, who showed that when the utilisation parameter of an M/M/1 queue is near 1, a scaled version of the queue length process can be accurately approximated by a reflected Brownian motion.^[2]

Heavy traffic condition

Heavy traffic approximations are typically stated for the process X(t) describing the number of customers in the system at time t. They are arrived at by considering the model under the limiting values of some model parameters and therefore for the result to be finite the model must be rescaled by a factor n, denoted^[3]

\hat X _{n(t)} = (X(nt) - E(X(nt)))/(\sqrt{n) }

and the limit of this process is considered as n → ∞.

There are three classes of regime under which such approximations are generally considered.

1. The number of servers is fixed and the traffic intensity (utilization) is increased to 1 (from below). The queue length approximation is a reflected Brownian motion.^{[4] [5] [6]}
2. Traffic intensity is fixed and the number of servers and arrival rate are increased to infinity. Here the queue length limit converges to the normal distribution.^{[7] [8] [9]}
3. A quantity β is fixed where

\beta = ( 1- \rho)\sqrt{s}

with ρ representing the traffic intensity and s the number of servers. Traffic intensity and the number of servers are increased to infinity and the limiting process is a hybrid of the above results. This case, first published by Halfin and Whitt is often known as the Halfin–Whitt regime^{[10] [11]} or quality-and-efficiency-driven (QED) regime.^[12]

Results for a G/G/1 queue

Theorem 1. ^[13] Consider a sequence of G/G/1 queues indexed by

j .
For queue j let T _{j} denote the random inter-arrival time, S _{j} denote the random service time;let \rho _{j = (λ _{j})/(\mu _{j})} denote the traffic intensity with (1)/(λ _{j}) = E(T _{j)} and (1)/(\mu _{j}) = E(S _{j)} ; let W _{q,j} denote the waiting time in queue for a customer in steady state; Let \alpha _{j=-E[S} _{j-T} _{j]} and \beta ^{2= \operatorname{var}[S} _{j - T} _{j];}

Suppose that

T _{j\xrightarrow{d}} T , S _{j\xrightarrow{d}} S , and \rho _{j} → 1 . then
(2 \alpha _{j})/(\beta ^{2} _{j}) W _{q,j} \xrightarrow{d} \exp( 1 )

provided that:

(a)

\operatorname{Var}[S - T]> 0

(b) for some

\delta > 0 , E[S ^{2+ \delta} _{j} ] and E[T ^{2+ \delta} _{j} ] are both less than some constant C for all j .

Heuristic argument

• Waiting time in queue

Let

U ^{(n)} = S ^{(n)} - T ^{(n)} be the difference between the nth service time and the nth inter-arrival time;Let W ^{(n)} _{q} be the waiting time in queue of the nth customer;

Then by definition:

W ^{(n)} _{q} =max (W ^{(n -1 )} _{q} + U ^{(n-1)} , 0 ) After recursive calculation, we have:W ^{(n)} _{q} =max (U ^{(1)} + … + U ^{(n-1)} ,U ^{(2)} + … + U ^{(n-1)} , \ldots,U ^{(n-1)} , 0 )

• Random walk

Let

P ^{(k)} = \sum ^{k} _{i =1} U ^{(n-i)} , with U ^{(i)} are i.i.d; Define \alpha =- E[U ^{(i)} ] and \beta ^{2=\operatorname{var}[U} ^{(i)} ] ;

Then we have

E[P ^{(k)} ] =- k\alpha \operatorname{var}[P ^{(k)} ] = k\beta ^{2} W ^{(n)} _{q} =max _{n-1\geq} P ^{(k)} ; we get W ^{( inf ty)} _{q} = \sup _{k} P ^{(k)} by taking limit over n .

Thus the waiting time in queue of the nth customer

W ^{(n)} _{q} is the supremum of a random walk with a negative drift.

• Brownian motion approximation

Random walk can be approximated by a Brownian motion when the jump sizes approach 0 and the times between the jump approach 0.

We have

P ^{(0)} =0 and P ^{(k)} has independent and stationary increments. When the traffic intensity \rho approaches 1 and k tends to inf ty , we have P ^{(t)} \sim \N( - \alpha t, \beta ^{2} t ) after replaced k with continuous value t according to functional central limit theorem.^[14] Thus the waiting time in queue of the n th customer can be approximated by the supremum of a Brownian motion with a negative drift.

• Supremum of Brownian motion

Theorem 2.^[15] Let

X be a Brownian motion with drift \mu and standard deviation \sigma starting at the origin, and let M _{t} = \sup _{0\leq} X(s)

if

\mu \leq 0 \lim _{t →} P(M _{t} > x) = \exp( 2 \mu x/\sigma ^{2} ), x \geq 0 ; otherwise \lim _{t →} P(M _{t\geq} x) =1 , x \geq 0 .

Conclusion

W ^{( inf ty)} _{q} \thicksim \exp\left( (2 \alpha)/(\beta ^{2}) \right) under heavy traffic conditionThus, the heavy traffic limit theorem (Theorem 1) is heuristically argued. Formal proofs usually follow a different approach which involve characteristic functions.^{[4] [16]}

Example

Consider an M/G/1 queue with arrival rate

λ , the mean of the service time E[S] = (1)/(\mu) , and the variance of the service time \operatorname{var}[S] = \sigma ^{2} _{B} . What is average waiting time in queue in the steady state?

The exact average waiting time in queue in steady state is given by:

W _{q = (\rho ^{2+λ} ^{2} ^{B})/(2λ ( 1- \rho))} The corresponding heavy traffic approximation: W ^{(H)} _{q} = (λ ( (1)/(+ \sigma ^{2 )} _{B} λ ^{2}))/(2 ( 1- \rho)) . The relative error of the heavy traffic approximation: (W ^{(H)} _{q} - W _{q})/(= W _{q}) (1- \rho ^{2})/(\rho ^{2+λ} ^{2} ^{B}) Thus when \rho → 1 , we have : (W ^{(H)} _{q} - W _{q})/(W _{q}) → 0 .

External links

• The G/G/1 queue by Sergey Foss

Notes and References

1. Halfin . S. . Whitt . W. . Ward Whitt. 10.1287/opre.29.3.567 . Heavy-Traffic Limits for Queues with Many Exponential Servers . Operations Research . 29 . 3 . 567 . 1981 .
2. Kingman . J. F. C. . John Kingman. 10.1017/S0305004100036094 . . Atiyah . The single server queue in heavy traffic . Mathematical Proceedings of the Cambridge Philosophical Society. 57 . 4 . 902 . October 1961 . 2984229. 1961PCPS...57..902K.
3. Book: Gautam, Natarajan . Analysis of Queues: Methods and Applications . CRC Press . 2012 . 9781439806586.
4. Kingman . J. F. C. . John Kingman . 1962 . On Queues in Heavy Traffic . Journal of the Royal Statistical Society. Series B (Methodological) . 24 . 2 . 383–392 . 2984229. 10.1111/j.2517-6161.1962.tb00465.x .
5. Iglehart . Donald L. . Ward . Whitt . Ward Whitt . 1970 . Multiple Channel Queues in Heavy Traffic. II: Sequences, Networks, and Batches . Advances in Applied Probability . 2 . 2 . 355–369 . 1426324 . 30 Nov 2012 . 10.2307/1426324 .
6. Köllerström . Julian . 1974 . Heavy Traffic Theory for Queues with Several Servers. I . Journal of Applied Probability . 11 . 3 . 544–552 . 3212698. 10.2307/3212698 .
7. Iglehart . Donald L. . 1965 . Limiting Diffusion Approximations for the Many Server Queue and the Repairman Problem . Journal of Applied Probability . 2 . 2 . 429–441 . 3212203. 10.2307/3212203 .
8. Borovkov . A. A. . On limit laws for service processes in multi-channel systems . 10.1007/BF01040651 . Siberian Mathematical Journal . 8 . 5 . 746–763 . 1967 .
9. Iglehart . Donald L. . 1973 . Weak Convergence in Queueing Theory . Advances in Applied Probability . 5 . 3 . 570–594 . 1425835. 10.2307/1425835 .
10. Puhalskii . A. A. . Reiman . M. I. . 10.1239/aap/1013540179 . The multiclass GI/PH/N queue in the Halfin-Whitt regime . Advances in Applied Probability . 32 . 2 . 564 . 2000 .
11. Reed . J. . The G/GI/N queue in the Halfin–Whitt regime . 10.1214/09-AAP609 . The Annals of Applied Probability . 19 . 6 . 2211–2269 . 2009 . 0912.2837 .
12. Whitt . W. . Ward Whitt. Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments . 10.1287/mnsc.1040.0279 . Management Science. 50 . 10 . 1449–1461 . 2004 . 30046186. 10.1.1.139.750 .
13. Book: Gross . D. . Shortie . J. F. . Thompson . J. M. . Harris . C. M. . Bounds and Approximations . 10.1002/9781118625651.ch7 . Fundamentals of Queueing Theory . 329–368. 2013 . 9781118625651 .
14. Book: Chen . H. . Yao . D. D. . Technical Desiderata . 10.1007/978-1-4757-5301-1_5 . Fundamentals of Queueing Networks . Stochastic Modelling and Applied Probability . 46 . 97–124. 2001 . 978-1-4419-2896-2 .
15. Book: Chen . H. . Yao . D. D. . Single-Station Queues . 10.1007/978-1-4757-5301-1_6 . Fundamentals of Queueing Networks . Stochastic Modelling and Applied Probability . 46 . 125–158. 2001 . 978-1-4419-2896-2 .
16. Book: Asmussen, S. R. . 10.1007/0-387-21525-5_10 . Steady-State Properties of GI/G/1 . Applied Probability and Queues . Stochastic Modelling and Applied Probability . 51 . 266–301 . 2003 . 978-0-387-00211-8 .