Basic Queuing Theory Formulas

Poisson distribution Little’s theorem

(λt)k −λt N = λef f T

P [X = k|T = t] = e , k = 0, 1, 2, . . .
k!
M/M/1
Geometric distribution
ρ = λ/µ
P [X = k] = (1 − p)k−1 p, k = 1, 2, . . .
Pk = (1 − ρ)ρk
1 1−p
E[X] = , V [X] =
p p2 N = ρ/(1 − ρ)

Exponential distribution W = ρ/(µ − λ)

 −λx
λe x≥0
fX (x) =
0 x<0 FW (t) = 1 − ρe−(µ−λ)t

1 − e−λx x ≥ 0

FX (x) =
0 x<0 FT (t) = 1 − e−(µ−λ)t

Erlang distribution M/M/m

ρ = λ/µ
xr−1 −λx

λr (r−1)! e x>0
fX (x, r) = (
0 x≤0 k
P0 ρk! k≤m
Pk = k
r r P0 m!mρk−m k≥m
E[X] = , V [X] =
λ λ2 Erlang-C
z-transform
mEm (ρ)
∞ Dm (ρ) = P (wait) =
X m − ρ(1 − Em (ρ))
F (z) = fn z n
n=0
λ
N = Ns + Nq = ρ + P (wait)
Laplace-transform mµ − λ
Z ∞
1
F (s) = f (t)e−st dt W = P (wait)
0 mµ − λ

1
 M/Er /1
FW (t) = 1 − Dm (ρ)e−µ(m−ρ)t r
Y µi
S ∗ (s) =
M/M/1/S i=1
s + µi

ρ = λ/µ M/Hr /1
r
(1 − ρ)ρk ∗
X µi
Pk = S (s) = αi
1 − ρS+1 i=1
s + µi
S
(1 − ρ)ρ
PS = P (blocking) = M/G/1
1 − ρS+1
ρ
N= (1 − (S + 1)PS ) 1 + Cs2 ρ2 σs2
1−ρ N =ρ+ , Cs2 = 2
2 1−ρ S
M/M/m/m λS 2 1 + Cs2 ρ
W = = S
2(1 − ρ) 2 1−ρ
ρ = λ/µ
(1 − ρ)(1 − z)
GN (z) = z
ρk /k! 1 − S ∗ (λ(1−z))
Pk = Pm ρk
s(1 − ρ)
k=0 k! W ∗ (s) =
Erlang-B s − λ + λS ∗ (s)

M/G/1 with vacations

ρm /m!
Em (ρ) = P (blocking) = Pm ρk
λS 2 V2
k=0 k! W = +
2(1 − ρ) 2V
N = ρ(1 − P (blocking))
M/G/1 with non-preemptive priority
M/M/m/ m/ n n
1X
R= λk Sk2
ρ = λ/µ 2 k=1

Pk : Engset distribution R
Wi =
(1 − ρ1 − . . . − ρi−1 )(1 − ρ1 − . . . − ρi )
n


ρk
Pk (n) = Pmk n

M/G/1 with preemptive priority
i=0 i
ρi
i
1X
Call blocking : Engset f ormula Ri = λk Sk2
2 k=1

n−1 m

(1 − ρ1 − . . . − ρi )S i + Ri
ρ Ti =
Bn (m, ρ) = Pm∗ (n) = Pm (n−1) = Pm m n−1
i (1 − ρ1 − . . . − ρi−1 )(1 − ρ1 − . . . − ρi )
i=0 i
ρ