Queueing Theory

Dated 23.09.2015

Formulas
M/M/1///F CF S
p0 = 1 , =
L=

1 ,
L

W =

(1) ,

Lq = L (1 p0 ) =
Wq =

Lq

, =

2
()

() .

Note that all above measures are valid only when < 1.
M/M/c///F CF S.
1

p0 =

c1

r
rc
+
n! c!(1 )

Lq =

, r = , =

n=0
rc p0
c!(1)2

Wq =

Lq

L = Lq + r =

r c p0
c!(1)2

W =

Moreover, we canc also express all above measures in terms of probabilities, i.e. it can be shown that
(c) p0
P r(n c) = c!(1)
And Lq =

P r(nc)
1

M/M/1/c///F CF S
Case A. When = 1.
1
1c+1

p0 =
L=

[1(c+1)c +cc+1 ]
(1c+1 )(1)

Lq = L (1 p0 )
W =
Wq =

L
(1pc )
Lq
(1pc )

pc is the probability of having c number of the customer in the system, and thus pc of arrivals
find the system filled to capacity and leave. Thus (1 pc ) arrivals per unit time will actually enter
the system.
Case B. When = 1.
1
p0 = c+1
L = 2c

 M/G/1///F CF S

2 2

+
Lq = 2(1)
,=
L = Lq +

Wq =
W =

Lq

M/M/R/K/K/F CF S.

pn = KCj j p0 , j = 0, 1, ..., R

L=

=
K

KCj j j!p0
R!RjR

npn

n=0
K

Lq =
=
W

n=R
K

(n R)pn

pn n = (K L)

n=0
= L

W =

, j = R + 1, R + 2, ..., K

Lq