1

Queuing Theory
Slide 2
M/M/1 Summary
0 ) 1 ( = k p
k
k

= =

=
1
0 k
k
kp N
Average queue length L
QQ
=
2
/(1-)
Average number of customers in the system
Mean delay for M/M/1 system
T

= (1/) * /(1-)
Probability that K customers are currently in the system

=
Where traffic rate
( )

= =

=
1
1
1
0 k
k Q
p k N
Average number of customers in the queue
Slide 3
M/M/1/N Queue

) N (
?
!
Slide 4
M/M/1/N Queue
If = : P
k
= 1/(N+1)
Slide 5
M/M/1/N Queue
Slide 6
M/M/1/N Queue
[1-(N+1)
N
+ N
N+1
]
(1-
N+1
) (1-)
L =
1
N/2
= 1
P
m
Slide 7
M/M/1/N Queue
...
Slide 8
M/M/1/N Queue
( )
eff
N N eff
eff
L
T
P P
system by accepted clients of Rate

=
= =
>
*
1 *
) (
Slide 9
M/M/1/N Example
What will be:
Average Delay?
Jitter?
Packet loss ratio?
1Mb
Line rate - 1Mb/s
Buffer size 500K [bits]
Packet size 1600byte
Slide 10
M/M/1/N Example
Jitter is the same as for worst case model
Max delay = 0.5M / 1M/s = 500ms
Min Delay = 1600 * 8 / 1 M/s = 12.8 ms
Jitter = 500 12.8 = 487.2 ms
% 5 . 2
1 N
1
ratio loss Packet
+
=

( ) | |
1
1 . 76
1
1
1 1

\
|
+
= = s
N
P
m eff

| |
40 1
8 1600
500
= +

=
kb
N
1
1
+
= =
N
P
N

| |
| | sec 263
1 . 76
20
20
2
1
m
s
L
W
N
L
eff
= = =
= =

| |
1
78
8 1600
/ 1

=

= s
s Mb

Slide 11
M/M/N/0 Queue Overview
) - N (
m
Slide 12
M/M/N/0 Queue Overview
1
0
0
0
0
0
! !
1

= = =
|
|

\
|
= = =

m
k
k
m
k
k
m
k
k
k
P P
k
P

=
=
m
k
k
k
k
k
k
P
0
!
!
: Erlang of on distributi first The

Slide 13
M/M/N/0 Queue Overview

=
=
m
k
k
k
k
k
k
P
0
!
!
: Erlang of on distributi first The

=
= =
m
k
k
m
m
k
m
P B
0
!
!
: formula B - Erlang The

Slide 14
M/M/N/0 Example
What will be:
Packet loss ratio?
3x1Mb
Line rate 3 * 1Mb/s
Packet size 1600byte
1 = =
% 25 . 6
!
1
! 3
1
3
3
0
= =

= k
k
k
B
Slide 15
M/M/N Queue Overview
) - N (
Slide 16
M/M/N Queue Overview
Slide 17
M/M/N Queue Overview
( )
( ) ( )
|
|

\
|

+
|
|

\
|
=
=
|
|

\
|

+
|
|

\
|
+
|
|

\
|
=

=
+

m m k
m m m k
P
m
m
k
k
m m
m
k
k
! 1 !
1
! ! !
1
1
0
1
1
0
0
B * + ) - (m
B * m
= ) ( E = 0) P(>
m 2,

M/M/N Queue
Recommended procedure for computation:
Compute first the Erlang-B blocking B :
Then use the following reduction formula for Erlang-C
blocking:
Direct formula:
P( > 0) = E
2,m
()
Probability to enter waiting line - P( > 0)
Erlang-C Formula
( ) ( )
1
1
0
1
! 1
!

=
(
(
(
(

+
|
|

\
|

|
|

\
|
= =

m m
k
P
m
m
k
k
m k
k
( )

=
= =
m
k
k
m
m
k
m
E B
0
, 1
!
!

Definitions:
W
A
= Average waiting time for any call
W
dA
= Average waiting time for a delayed call
The relationship:
W
A
= P(>0) * W
dA
Average Waiting Time
( ) ( ) 0 0 1 < + P
t time Reference
1
time service Average
m serversc of Number
traffic offered The
: data The

>
|
|

\
|

=
> =
formula C - Erlang to according computed ) 0 ( P
1 1
W
W 0) P( W
: formula The
dA
dA A
m
( )

+ =

=
1
?
1
m k
K
m
P m k

'
, .
Definitions:
P(>t) = P(Waiting time > t)
= Probability of any originating call to wait > t
P
d
(>t) = P( Waiting time > t | Waiting time > 0 )
= Probability of a delayed originating call to wait > t
(a conditional probability).
The relationship:
P(>t) = P(>0) * P
d
(>t)
Obviously that P(>t) < P
d
(>t)
Probability of (W >t) : Concepts
Probability of (W >t) : Formulas
( ) { }

>
> = >
> > = >
formula C - Erlang to according computed : 0) P(
0 t , exp t) Pd(
t) ( P 0) P( t) P(
: formulas The
d
t m
1 ) t ( P ) t ( P : m for
m : ity applicabil of Range
d
= > = >
<

Slide 22
M/M/N Example
What will be:
Average Delay?
Probability of delay more than 300ms?
3x1Mb
Line rate - 1Mb/s
Buffer size 500K [bits]
Packet size 1600byte
3
1
=
=

Slide 23
M/M//N Example
( ) B
B
B m
B m
P
m
+
=
+

= >
=
=

2
3
) 0 (
1
3

16
1
!
!
1 , 3
0
= =
= =
=

m
m
k
k
m
k
m
B
11
1
) 0 (
16
1 = >
= B
P
| |
| |
( )
| | sec 194 . 0
1
) 0 ( ) 0 (
234
8 1600
3
1
m
m
P W P W
s
Mbps
dA A
=

> = > =
=

= =



( ) { }
63
10 63 . 9 ) 300 (
3 . 0 234 1 3 exp
11
1
) 300 ( ) 0 ( ) 300 (

= >
= > > = >
ms P
ms P P ms P
d
Slide 24
Something More realistic?
State Transition Diagram for 2-Priority M/M/1 Queue with Preemptive Priority
Slide 25
M/M/1/N Queue
Slide 26
Slide 27
Slide 28