UNIT-6

Introduction to Queuing Theory

Little formulas (Single server model)
Single Server infinite queue

It is expressed in terms of Kendal’s notations as

(a/b/c) :(d/e/f)

a-arrival distribution

b-departure distribution

c-numbers of parallel servers

d-queue discipline

e-size of calling source

Markov chain in M/M/1 Model

In a BD process there is transition period and in that period queue system does not stabilize. A
queuing system begins only at the condition when it stabilize comes to the state of equilibrium.
Once, the queuing system is come in to equilibrium, it can be very easily explain by its rate diagram.

A rate diagrame describe the BD process with equal arrival rate and departure rate for a state.

2
Means, 2 customers in system and so on.
 𝜆 𝜆
𝑝2 = 𝑝1 + 𝑝1 − 𝑝1 = 𝑝1
𝜇 𝜇
Hence, we got two interesting two equation as
𝝀 𝝀
=𝒑𝟏 = 𝒑𝟎, 𝒑𝟐 = 𝝁 𝒑𝟏
𝝁

Now let us consider λ/ú=ρ, then

 By using little formula , we can derives as

Here, it is important to note that if services rate is lower than arrival rate , in this case queuing
system may not reach state of equilibrium, hence we can not use the BD process for its modeling
means that queuing system will be in transient state not in steady state.