K.L.N. COLLEGE OF ENGINEERING, POTTAPALAYAM-630 612.

(An Autonomous Institution affiliated to Anna University, Chennai)

DEPARTMENT OF MATHEMATICS

QUEUEING MODELS
1. What are the basic characteristics of a Queueing system?
Soln: The basic characteristics of a Queueing system are
(i) Arrival pattern of customer
(ii) Service pattern of servers
(iii) Queue discipline and
(iv) System capacity
2. What are the basic characteristics of a Queueing Process?
Soln: The basic queuing process describes how customers arrive at and Proceed
through the queuing system. This means that the basic Queuing process describes
the operation of a queuing system.
(i) the calling population (ii) the arrival process
(iii) the queue configuration (iv) the queue discipline and
(v)the service mechanism
---------------------------------------------------------------------------------------------------------------------
3. What do you mean by transient state and steady state queueing system?
Soln:
Transient state : If the characteristic of a queuing system are independent of time
Steady state :If the characteristic of a queuing system are dependent of time
---------------------------------------------------------------------------------------------------------------
4. What do the letters in the symbolic representation (a/b/c): (d/e) of a queueing model
represent?
In the symbolic representation (a/b/c): (d/e)
a= probability law for the arrival,
b=probability law according to which customers are served,
c=number of service stations, d= capacity of the system , e=Queue discipline.
-------------------------------------------------------------------------------------------------------------
5. What do you mean by Balking and Reneging?
Balking: A customer decide not to enter the queue upon arrival.
Reneging: A customer may enter the queue, but after a time lose patience.
---------------------------------------------------------------------------------------------------------------
6. What is the probability that a customer has to wait more than 15 minutes to get his
servicecompleted in (M/M/1) : ( ¥/FCFS) queue system if
λ=6 per hourandμ=10 perhour ?
Soln:
P ¿waiting time of a customer in the system exceeds t=15 min]= −( μ − λ ) t ( 10−4 6 )
e =e
−1
¿ e =0. 3697
--------------------------------------------------------------------------------------------------------------
7. In the usual notation of a (M/M/1) queuing system ] if λ=12/hr andm=24/hr,Find the
average number of customer in the system.
Soln: : Given λ=12 per hour
m= 24 per hour
 λ 12
Average number of customer in the system= Ls = = =1
μ − λ 24 −12

8. In the usual notation of a (M/M/1):(¥/FIFO) queue system find P[N>2] if λ=12/hr

and m=30/hr
Soln:
Here λ=12/hr, m=30/hr , K=2
λ 12 2
r= = =
μ 30 5
WKT P [ N > K ] =ρk +1
3
2
P [ N > 2 ] =( ) =0 . 064
5
------------------------------------------------------------------------------------------------------------
9. If a customer has to wait in a ( M / M /1 ) : ( ∞ /FIFO ) queue system, what is the average
waiting time in the queue, if μ=12 perhour∧ λ=8 perhour ?
Soln:Here λ=8/hr, m=12/hr
λ 8
w q= = =0.166
μ(μ − λ) 12(12 −8)
-----------------------------------------------------------------------------------------------------------
10. Suppose that customers arrive at a Poisson rate of one per every 12 minutes, and
that the service time is exponential at a rate of one service per 8 minute
(i) What is the average number of customer in the system.
(ii) What is the average time of a customer spends in the system.
2
3
Soln: Ls = ❑ = =2
1− 2
1−
3
1
W s= L =12× 2=24 minutes
λ s
---------------------------------------------------------------------------------------------------------------
11. Consider an M/M/1 queueing system. If A = 6/hr, μ = 8/hr find the probability that
atleast10 customers in the system.
Soln: P[N≥ k] = sk so, P[N≥ 10] = (s)10 = 0.0563

λ 2
12. In a 3 server infinite capacity Poisson Queue Model if = find P0?
μc 3
λ 2 λ 2 λ
Soln: Given = , No. of servers C=3, = , =2
μc 3 3μ 3 μ
P0=¿
1
P0=¿ =
4

----------------------------------------------------------------------------------------------------------------------------

13. If there are 2 servers in a infinite capacity Poisson queue system with λ=10 per
hour,m = 15 per hour.What is the percentage of idle time for each server?
 Soln:
Given λ=10 per hour
λ 2
m= 15 per hour, c=2r= =
μ 3
P0=¿
P0=¿
1
Percentage idle time = ∗100=50 %
2
-----------------------------------------------------------------------------------------------------------
14. If λ=4 per hour ,m = 12 per hour in an ( M / M /1 ) : ( 4 /FIFO ) queueing system , find
the probability that there is number of the customer in the system.
λ 1
Soln: : Given λ=4 per hour, m= 12 per hour, r= =
μ 3
1
1−
1−ρ 3 81
P[there is number of the customer in the system]= = =
1− ρ
N +1
1
5
121
1−( )
3
------------------------------------------------------------------------------------------------------------
15. What is the steady state condition for M/M/C queueing model.[Nov/Dec 2014]

{
n
1 λ
( ) P0 , 0 ≤ n<c
n! µ
Ans: Pn¿ 1 λ n
n −c
( ) P0 , c ≤ n ≤ N
c!c µ
0 n> N
c− 1 N
1 λ n 1 λ n −1
Gives P0=[ ∑ ( ) + ∑ n −c ( ) ]
n=0 n! µ n=c c c! µ
------------------------------------------------------------------------------------------------------------
16. Define effective arrival rate with respect to an (M/M/S):(K/FIFO) queueing model.

Soln: Effective arrival rate= λ ' =μ ¿

17. If λ=3 per hour ,m = 4 per hour and maximum capacity N=7 in a
( M / M /1 ) : ( N /FIFO ) queueing system , find the average number of the customer in
the system.
Soln: Given λ=3 per hour,m= 4 per hour , N=7
Average number of customer in the system
N+1
( N +1 ) ( λ )
λ μ = 3 – 0.8898 = 2.11
Ls = −
μ−λ 1 −¿ ¿
-------------------------------------------------------------------------------------------------------------------
18. State Little’s Formula for the queueing model (M/M/1): (K/FIFO).[Nov/Dec 2016]
k +1
ρ k (k + 1) ρ
Ls = − Lq=Ls − ρ
1−ρ 1− ρk+1
Lq Ls '
W s= '
W q= '
λ =μ ( 1 − p0 )
λ λ
--------------------------------------------------------------------------------------------------------------------

ADVANCED QUEUING MODELS

1. Write the flow balance equations of open Jackson Network.
Ans: The traffic equation for Open Network is
k
λ j=r j + ∑ λ j p ij ; j=1,2,…,k
i=1
Where pij is the probability that a departure from server i joins the queue at server
j. Traffic equations are also known as flow balance equations.
-----------------------------------------------------------------------------------------------
2. Give an example for a non Markovian queuing model.
Ans:
A TVS company in Chennai containing a repair section shared by a large number
of machines has 2 sequential stations with respective service rates of 3per hour and
4 per hour. The cumulative failure rate of all the machines is 1 per hour.
-----------------------------------------------------------------------------------------------
3. What do you mean by M/G/1 queue?
Ans:
In the M/G/ 1 Queueing system under study, we consider a single- server queueing
system with infinite capacity, Poisson arrivals and general service discipline. The
model has arbitrary service time, and it is not necessary to be memoryless.
-----------------------------------------------------------------------------------------------
4. Define effective arrival rate with respect to an (M/M/1):(G D / N /∞ ) queueing model.
'
Ans: λ =μ (1− P0 ).
-----------------------------------------------------------------------------------------------
1
5. In an M/G/1 Model if λ=5, μ=6min, and σ = . Find the value of LS .
20
1 λ 5
Ans: λ = 5 min, and µ= 6 min, and σ = ρ= =
20 µ 6
2 2 2
λ σ +ρ
Ls = ρ + = 3.103
2(1 − ρ)
-----------------------------------------------------------------------------------------------
6. Automatic car wash facility operates with only one bay. Cars arrive according to a
poisson process with mean of 4 cars per hour and may wait in the facility’s parking
lot if the bay is busy. If the service times for all cars is constant and equal to 10
minutes. Determine LS and W S.
Ans: λ=4 per hour =1/15 per min .
Service time T is a constant. E(T)=10 and Var(T)=0
2 2
λ [Var ( T )+(E(T )) ] 4
Ls =λE ( T ) + = .
2(1 − λE( T )) 3
Ls
By Little’s formula,W s= = 20 minutes.
λ
-----------------------------------------------------------------------------------------------

7. Write down the steady state equation for series queues with blockings.
 Ans: At (0,0) λ P0,0 = µ 2p0,1
At (1,0) µ1p1,0 = µ 2p1,1 + λ P0,0
At (0,1) ( λ + µ 2)p0,1 = µ 1p1,0 + µ 2p b,1
At ( 1,1) (µ 1+ µ 2) p1,1 = λ p0,1
At (b,1) µ 2pb,1 = µ 1p1,1
-----------------------------------------------------------------------------------------------
8. What is probability that a customer has to wait more than 15min to get his service
completed in a (M/M/1) queueing system. If λ=6 per hour and μ=10 per hour?
Ans: Given: λ=6 per hour μ=10 per hour
Probability that the waiting time in the system exceeds t = P(W s >t)
= e −(μ − λ)t

(
P W s> )
15
60
=e− 1=0 . 3679.
-----------------------------------------------------------------------------------------------
1
9. In an M/G/1 Model if λ=4 , μ=5 min, and σ = . Find the value of W S.
10
1 λ 4
Ans: λ = 4 min, and µ= 5 min, and σ = ρ= =
10 µ 5
2 2 2
λ σ +ρ
Ls = ρ + = 2.64
2(1 − ρ)
--------------------------------------------------------------------------------------------
10. Automatic car wash facility operates with only one bay. Cars arrive according to a
poisson process with mean 5 cars per hour and may wait in the facility’s parking lot
if the bay is busy. If the service times for all cars is constant and equal to 20 minutes.
Determine W S.
Ans: λ=5per hour =1/12 per min .
Service time T is a constant. E(T)=20 and Var(T)=0
λ2 [Var ( T )+(E(T ))2 ] 10
Ls =λE ( T ) + = .
2(1 − λE(T )) 9
L 40
By Little’s formula,W s= s = minutes.
λ 3
--------------------------------------------------------------------------------------------------------
11. What is probability that a customer has to wait more than 20min to get his service
completed in a (M/M/1) queueing system. If λ=5per hour and μ=8per hour?
Ans: Given: λ=5 per hour μ=8 per hour
Probability that the waiting time in the system exceeds t = P(W s >t)
= e −(μ − λ)t

(
P W s> )
20
60
=e− 1=0 . 3679.
-----------------------------------------------------------------------------------------------
12. There are 2 salesman in a supermarket. Out of the 2 salesman one is incharge of
weighing and delivering the items. Due to lack of space, only one customer is
allowed to enter the shop , only if the billing clerk is free. If the customer arrive
according to a poisson process at the rate of 5 per hour and both the salesman take 6
minutes. Find the average rate of entering of customers in the supermarket.
 1
Ans: Given: λ=5 per hour μ1=μ2 =μ=6 min = per hour
10
2
2μ 200 8
p0 , 0 = 2 2
= =
2 μ + 4 λμ+3 λ 475 19
λ 4
p0 , 1= p 0 ,0=
μ 19
Average rate of entering of customers in the supermarket
8 4 60
λ A= λ ( p 0 ,0 + p0 , 1 )=5( + )=
19 19 19
----------------------------------------------------------------------------------------------------------
13. What is the probability that a customer has to wait more than 25 min. to get his
service completed in a M/M/1 queueing system. If λ=7per hour and μ=9per hour?
Ans: Given: λ=7 per hour μ=9 per hour
Probability that the waiting time in the system exceeds t = P(W s >t)
= e −(μ − λ)t

( )
5
25 −
P W s> =e 6 .
60
-----------------------------------------------------------------------------------------------
14. Give any two examples for series Queues.
1. A registration process for the admission into a university where the applicant
must visit a series of desks such as advisor, cashier, department etc.
2. A physical examination for a patient where the patient undergoes through a series
of stages lab tests electrocardiogram, chest X-ray, etc.
-----------------------------------------------------------------------------------------------
15. State Jacksons theorem for an open network. [April/May 2015], [Nov/Dec 2014]
Ans: P(ko ,k1 ,k2,……kn) = P(ko) P(k1)…….P(kn)
-----------------------------------------------------------------------------------------------------------
16. What do you mean by Ek in the M/Ek/1 queueing model? [April/May 2015]
Ans: Service time follows Erlang type-k distribution, rateof each service phase is Eμ
------------------------------------------------------------------------------------------------------------
17. State P-K formula for the average number in the system in a M/G/1 queueing
model and hence derive the same when the service time is constant with
1
mean . [May/June 2015](NOV/DEC 2016)
μ
2 2 2
λ σ +ρ 1
Ans: w s = +
2 λ(1 − ρ) μ
18. Define bottle-neck of the system in queue networks..[NOV/DEC 2016]
Ans:
As the arrival rate 𝜆 in a 2-state tandem queue model increases, the node with the larger
λi
value of ρi= will introduce instability. Hence the node with the larger value of ρi is called
μi
the bottleneck of the system.
----------------------------------------------------------------------------------------------------