- Source: Heavy traffic approximation
In queueing theory, a discipline within the mathematical theory of probability, a heavy traffic approximation (sometimes called heavy traffic limit theorem 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.
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: 490
X
^
n
(
t
)
=
X
(
n
t
)
−
E
(
X
(
n
t
)
)
n
{\displaystyle {\hat {X}}_{n}(t)={\frac {X(nt)-\mathbb {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.
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.
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.
A quantity β is fixed where
β
=
(
1
−
ρ
)
s
{\displaystyle \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 or quality-and-efficiency-driven (QED) regime.
Results for a G/G/1 queue
Theorem 1. Consider a sequence of G/G/1 queues indexed by
j
{\displaystyle j}
.
For queue
j
{\displaystyle j}
let
T
j
{\displaystyle T_{j}}
denote the random inter-arrival time,
S
j
{\displaystyle S_{j}}
denote the random service time;
let
ρ
j
=
λ
j
μ
j
{\displaystyle \rho _{j}={\frac {\lambda _{j}}{\mu _{j}}}}
denote the traffic intensity with
1
λ
j
=
E
(
T
j
)
{\displaystyle {\frac {1}{\lambda _{j}}}=E(T_{j})}
and
1
μ
j
=
E
(
S
j
)
{\displaystyle {\frac {1}{\mu _{j}}}=E(S_{j})}
;
let
W
q
,
j
{\displaystyle W_{q,j}}
denote the waiting time in queue for a customer in steady state;
Let
α
j
=
−
E
[
S
j
−
T
j
]
{\displaystyle \alpha _{j}=-E[S_{j}-T_{j}]}
and
β
j
2
=
var
[
S
j
−
T
j
]
;
{\displaystyle \beta _{j}^{2}=\operatorname {var} [S_{j}-T_{j}];}
Suppose that
T
j
→
d
T
{\displaystyle T_{j}{\xrightarrow {d}}T}
,
S
j
→
d
S
{\displaystyle S_{j}{\xrightarrow {d}}S}
, and
ρ
j
→
1
{\displaystyle \rho _{j}\rightarrow 1}
. then
2
α
j
β
j
2
W
q
,
j
→
d
exp
(
1
)
{\displaystyle {\frac {2\alpha _{j}}{\beta _{j}^{2}}}W_{q,j}{\xrightarrow {d}}\exp(1)}
provided that:
(a)
Var
[
S
−
T
]
>
0
{\displaystyle \operatorname {Var} [S-T]>0}
(b) for some
δ
>
0
{\displaystyle \delta >0}
,
E
[
S
j
2
+
δ
]
{\displaystyle E[S_{j}^{2+\delta }]}
and
E
[
T
j
2
+
δ
]
{\displaystyle E[T_{j}^{2+\delta }]}
are both less than some constant
C
{\displaystyle C}
for all
j
{\displaystyle j}
.
Heuristic argument
Waiting time in queue
Let
U
(
n
)
=
S
(
n
)
−
T
(
n
)
{\displaystyle U^{(n)}=S^{(n)}-T^{(n)}}
be the difference between the nth service time and the nth inter-arrival time;
Let
W
q
(
n
)
{\displaystyle W_{q}^{(n)}}
be the waiting time in queue of the nth customer;
Then by definition:
W
q
(
n
)
=
max
(
W
q
(
n
−
1
)
+
U
(
n
−
1
)
,
0
)
{\displaystyle W_{q}^{(n)}=\max(W_{q}^{(n-1)}+U^{(n-1)},0)}
After recursive calculation, we have:
W
q
(
n
)
=
max
(
U
(
1
)
+
⋯
+
U
(
n
−
1
)
,
U
(
2
)
+
⋯
+
U
(
n
−
1
)
,
…
,
U
(
n
−
1
)
,
0
)
{\displaystyle W_{q}^{(n)}=\max(U^{(1)}+\cdots +U^{(n-1)},U^{(2)}+\cdots +U^{(n-1)},\ldots ,U^{(n-1)},0)}
Random walk
Let
P
(
k
)
=
∑
i
=
1
k
U
(
n
−
i
)
{\displaystyle P^{(k)}=\sum _{i=1}^{k}U^{(n-i)}}
, with
U
(
i
)
{\displaystyle U^{(i)}}
are i.i.d;
Define
α
=
−
E
[
U
(
i
)
]
{\displaystyle \alpha =-E[U^{(i)}]}
and
β
2
=
var
[
U
(
i
)
]
{\displaystyle \beta ^{2}=\operatorname {var} [U^{(i)}]}
;
Then we have
E
[
P
(
k
)
]
=
−
k
α
{\displaystyle E[P^{(k)}]=-k\alpha }
var
[
P
(
k
)
]
=
k
β
2
{\displaystyle \operatorname {var} [P^{(k)}]=k\beta ^{2}}
W
q
(
n
)
=
max
n
−
1
≥
k
≥
0
P
(
k
)
;
{\displaystyle W_{q}^{(n)}=\max _{n-1\geq k\geq 0}P^{(k)};}
we get
W
q
(
∞
)
=
sup
k
≥
0
P
(
k
)
{\displaystyle W_{q}^{(\infty )}=\sup _{k\geq 0}P^{(k)}}
by taking limit over
n
{\displaystyle n}
.
Thus the waiting time in queue of the nth customer
W
q
(
n
)
{\displaystyle W_{q}^{(n)}}
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
{\displaystyle P^{(0)}=0}
and
P
(
k
)
{\displaystyle P^{(k)}}
has independent and stationary increments. When the traffic intensity
ρ
{\displaystyle \rho }
approaches 1 and
k
{\displaystyle k}
tends to
∞
{\displaystyle \infty }
, we have
P
(
t
)
∼
N
(
−
α
t
,
β
2
t
)
{\displaystyle P^{(t)}\ \sim \ \mathbb {N} (-\alpha t,\beta ^{2}t)}
after replaced
k
{\displaystyle k}
with continuous value
t
{\displaystyle t}
according to functional central limit theorem.: 110 Thus the waiting time in queue of the
n
{\displaystyle n}
th customer can be approximated by the supremum of a Brownian motion with a negative drift.
Supremum of Brownian motion
Theorem 2.: 130 Let
X
{\displaystyle X}
be a Brownian motion with drift
μ
{\displaystyle \mu }
and standard deviation
σ
{\displaystyle \sigma }
starting at the origin, and let
M
t
=
sup
0
≤
s
≤
t
X
(
s
)
{\displaystyle M_{t}=\sup _{0\leq s\leq t}X(s)}
if
μ
≤
0
{\displaystyle \mu \leq 0}
lim
t
→
∞
P
(
M
t
>
x
)
=
exp
(
2
μ
x
/
σ
2
)
,
x
≥
0
;
{\displaystyle \lim _{t\rightarrow \infty }P(M_{t}>x)=\exp(2\mu x/\sigma ^{2}),x\geq 0;}
otherwise
lim
t
→
∞
P
(
M
t
≥
x
)
=
1
,
x
≥
0.
{\displaystyle \lim _{t\rightarrow \infty }P(M_{t}\geq x)=1,x\geq 0.}
Conclusion
W
q
(
∞
)
∼
exp
(
2
α
β
2
)
{\displaystyle W_{q}^{(\infty )}\thicksim \exp \left({\frac {2\alpha }{\beta ^{2}}}\right)}
under heavy traffic condition
Thus, the heavy traffic limit theorem (Theorem 1) is heuristically argued. Formal proofs usually follow a different approach which involve characteristic functions.
Example
Consider an M/G/1 queue with arrival rate
λ
{\displaystyle \lambda }
, the mean of the service time
E
[
S
]
=
1
μ
{\displaystyle E[S]={\frac {1}{\mu }}}
, and the variance of the service time
var
[
S
]
=
σ
B
2
{\displaystyle \operatorname {var} [S]=\sigma _{B}^{2}}
. 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
=
ρ
2
+
λ
2
σ
B
2
2
λ
(
1
−
ρ
)
{\displaystyle W_{q}={\frac {\rho ^{2}+\lambda ^{2}\sigma _{B}^{2}}{2\lambda (1-\rho )}}}
The corresponding heavy traffic approximation:
W
q
(
H
)
=
λ
(
1
λ
2
+
σ
B
2
)
2
(
1
−
ρ
)
.
{\displaystyle W_{q}^{(H)}={\frac {\lambda ({\frac {1}{\lambda ^{2}}}+\sigma _{B}^{2})}{2(1-\rho )}}.}
The relative error of the heavy traffic approximation:
W
q
(
H
)
−
W
q
W
q
=
1
−
ρ
2
ρ
2
+
λ
2
σ
B
2
{\displaystyle {\frac {W_{q}^{(H)}-W_{q}}{W_{q}}}={\frac {1-\rho ^{2}}{\rho ^{2}+\lambda ^{2}\sigma _{B}^{2}}}}
Thus when
ρ
→
1
{\displaystyle \rho \rightarrow 1}
, we have :
W
q
(
H
)
−
W
q
W
q
→
0.
{\displaystyle {\frac {W_{q}^{(H)}-W_{q}}{W_{q}}}\rightarrow 0.}
External links
The G/G/1 queue by Sergey Foss
References
Kata Kunci Pencarian:
- Rel
- Heavy traffic approximation
- Queueing theory
- Kingman's formula
- M/M/c queue
- M/M/1 queue
- Round-robin scheduling
- Little's law
- G/G/1 queue
- M/M/∞ queue
- FIFO (computing and electronics)
