Birth-Death Processes

- Numbered circles = states =number of packets in system

- Arrows = possible transitions =change in number of packets in system
- Arrow labels =transition rates between states
-
k
=birth-rate when process in state k =arrival rate of packets, k in system
-
k
=death-rat when process in state k =departure rate when k in system

A/B/m/K/p queuing discipline
- A =the distribution of inter-arrival times;
- B =the distribution of service times;
o M =Memoryless or Markovian = Exponentially distributed inter-arrival times or
services times
o GI =General independent (unknown distribution but with independent arrival
times)
o G =General distribution (unknown distribution)
- m =number of servers in the system;
- K = storage capacity of the overall system =number of queuing places +number of
servers;
- p = the number of users of the system (if not specified, p = infinite);
- queuing discipline ={FCFS, LCFS, Priority}.









M/M/1



M/M/1 with Balking
(Discouraged)



M/M/1/K




M/M/




M/M/m




M/M/m/m Loss System

M/M/1
M/M/1 with
Balking
(Discouraged) M/M/1/K M/M/ M/M/m M/M/m/m Loss System
0
1 p

=

0
p e

=

0 1
1
1
K
p

0
p e

=

( ) 1
k
k
p =
( / )
!
k
k
p e
k

=
1
(1 )
1
k
k K
p

For 1 = then
1
1
k
p
K
=
+


( / )
!
k
k
p e
k

=
Erlang C Formula
Erlang B Formula
Call Blocking
Probability
Average number
of customers in
system
1
N

1
1
(K 1)
1 1
K
K
N


+
+
+
=

N a

= =


1
T

=

1
1
1
K
eff
K
N N
T

+
= =
| |
|

\ .


1
T

=

W


=