Subject Name & Code: MA 8402 - Probability and Queuing Theory 2020-21

DEPARTMENT OF MATHEMATICS
CLASS NOTES
MA 8402 – PROBABILITY AND QUEUEING THEORY
UNIT IV QUEUEING MODELS
Kendall’s notations for queueing model:
(a / b / c) : (d / e) is the Kendall’s notation
Where
a  Arrival pattern (or)Probability law or distribution
b  Service time probability distribution
c  Number of servers
d  Capacity of the system
e  Service discipline.
Various queue disciplines in queueing model:
This is the manner by which customer are selected for service when a queue has formed. The most
common queues discipline are
1. FIFO –First In First Out (OR) FCFS – First Come First served
2. LIFO – Last In First Out (OR) LCFS – Last Come First Served
3. SIRO – Selection In Random Order
4. PIR – Priority in Section
Transient state and Steady state of queueing system:
A queueing system is in transient state when its operating characteristics are depend on time. It is in steady
state when the characteristics are independent on time.
Customers behavior:
Generally a customer behaves in the following ways
Balking: A customer who refuses to enter queueing system because the queue is too long is said to be balking.
Reneging: A customer who leaves the queue without receiving service because of too much waiting (or due to
impatience) is said to have reneged.
Queue with discouragement:
If a customer is discouraged to join the queue expecting a long waiting time or having the impatience in
getting the service, the queueing model is said to be the queue with discouragement.
Different types of queueing models:
Model I : (M/M/1);(  /FCFS) :Single server & Infinite capacity
Model II :(M/M/c);(  /FCFS) : Multiple server & Infinite capacity
Model III : (M/M/1);(k/FCFS) : Single server & Finite capacity
Model IV : (M/M/c);(k/FCFS) : Multiple server & Finite capacity
Notations:
1. Pn  Probability that n number of customer in the system.
2. P0  Probability that no customer in the system.
3. Ls  E ( N )  The average (Expected) number of jobs in the system.
4. Lq  E ( N  1)  The average (Expected) number of jobs in the queue.
5. Ws  Average (Expected) waiting time in the system.
6. Wq  Average (Expected) waiting time in the queue.
7.   The server is busy (or) Traffic intensity (or) Utilization factor.

St. Joseph’s College of Engineering Page No 1

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

8.    Effective arrival rate.

Model I : (M/M/1);(  /FCFS) : Single server & Infinite capacity:
This model represents a queueing system with single server, Poisson arrival, exponential service time and
there is no limit on the system capacity and the customers are served on a first come first served basis.
Characteristics
1. A supermarket has 2 girls running up sales at the counters. If the service time for each customer is
exponential with mean 4 minutes and if people arrive in Poisson fashion at the rate of 10 per hour, find
the following:
(i) What is the probability of a customer have to wait for service?
(ii) What is the expected percentage of idle time for each girl?
(iii) What is the expected length of customer’s waiting time?
(iv) What is the expected number of idle girls at any time? (Ap/May’15)
Solution:
Model identification: Since there are two girls and infinite capacity.
Hence this problem comes under the model (M/M/c);(  /FCFS).
Given data:
Arrival rate   10 per hr
1 60
Service rate   per min (i.e)    15 per hr.
4 4
Number of servers c  2
1
 c 1 1   n c  
c

w.k.t P0         
 n 0 n !    c !(  c   )    
1
 1 1  10 n 2 15  10  
2

P0        
 n 0 n !  15  2!((2 15)  10)  15  
1
 1 1 30 2
   0.6667    0.6667  
n

 n 0 n ! 40 
1
 1 1 
   0.6667   0.3333
n

 n 0 n ! 
P0  (1  0.6667)  0.3333  21  0.5
1

i) The probability that a customer has to wait for the service is

c
 10 
2

   
 15   
P( N s  2)  (0.5) P( N s  c)  P0
 10    
2!1   c !1  
 15  2   c 
 0.6667 
2
1
P( N s  2)  (0.5)   0.1667
1.3333 6
 10 1
ii) Fraction of time that a girl is busy     
c 2  15 3
 Fraction of time when a girl is idle = 1- Fraction of time that a girl is busy

St. Joseph’s College of Engineering Page No 2

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

1 2
= 1 
3 3
2
 Percentage of idle time of for each girl   100  67%
3
Lq 1
iii) Expected waiting time of customer = Ws  
 
c 1 2
1    
Where Lq    1   P0
c.c !     c 
2

 0.6667  1   (0.5)  0.083

1 3 10

(2)2!  30 
Lq 1 0.083 1
Ws      0.0083 hrs
  10 15
iv) The expected no. of idle girl:
E( no. of idle girl ) = ?

No.of idle girls: 2 1 0

Probability P0 P1 P2
E(idle time for each girl)=2 P0 +1 P1 +0 P2
Now, P0 =0.5
n
1 
w.k.t Pn    P0 , 0  n  c
n!   
1
1  10  1
P1    (0.5)  0.333 
1!  15  3
2
1  10  1
P2    (0.5)  0.1111 
2!  15  9
1 1 5
E(idle no of girl)=2 P0 +1 P1 +0 P2 = 2   1  0 
9 3 9
 The expected no. of idle girl = 0.5556
2. A small mail –order business has one telephone line and a facility for call waiting for two additional
customers. Orders arrive at the rate of one per minute and each order requires 2 minutes and 30
seconds to take down the particulars. What is the expected number of calls waiting in the queue? What
is the mean waiting time in the queue?
(Ap/May’15)
Solution:
Model identification:
since there is only one telephone line and the capacity of the system is finite. Hence this problem comes under
the model (M/M/1);(k /FCFS).
Given Data:
Arrival rate :   1/ min

St. Joseph’s College of Engineering Page No 3

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

51 2  1 5
Service rate:    per min , k=3   
   2.5
 2 5  2/5 2

The expected number of calls waiting in the queue = Lq  Ls 

 (k  1) 
k 1
Where Ls   , if    and     1  P0 
1  1   k 1
2.5 4(2.5)4
Ls    0.3333  4.105  4.4383
1  2.5 1  (2.5) 4
(1   )
P0  , if   
1   k 1
1  2.5 1.5
P0    0.0394
1  (2.5) 4
38.06
2
   1  0.0394   0.3842
5
0.3842
The expected number of calls waiting in the queue = Lq  4.4383   3.4778
0.4
Ls 1 4.4383
The mean waiting time in the queue= Wq     2.5  11.55  2.5  9.052
   0.3842
3. Find the system size probabilities for an M / M / S : FCFS /  /  queueing system under steady state
conditions. Also obtain the expression for average number of customers in the system and waiting time
of a customer in the system. (Nov/Dec’11), (Ap/May’11)
Solution:
Assume S  c   M / M / c  ;( / FCFS )
This model represents a queueing system with poisson arrivels, exponential service time, multiple servers,
infinite capacity and FCFS queue service from a single queue.
If n  c, then only n of the c servers will be busy and others are idle and hence mean service rate will be n .
If n  c, all c servers will be busy and hence the mean service rate is c 
n , 0  n  c
n   and n   n
c  , n  c
By birth and death process
0 12 3 ....n1
Pn  P
1 2 3 4 ....n 0
Case i: When 0  n  c
.... (n times)
Pn  P0
1 2 3 4....n 
1 
Pn    P0
n!   
Case ii: when n  c
......(n times)
Pn  P
1 2 ....c ....c 1 ....n 0

St. Joseph’s College of Engineering Page No 4

Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

n
 P
1 2 3...(c  1)c c...(c  (c  1)) times 0
n
 P0
(c  1)!  c 1c n c 1  n c 1
n
 P0
(c  1)!c nc 1 nc 1c 1
n
 P0
c(c  1)!c n c  n
n
1 
Pn  nc   P0 , nc n !  n(n  1)!
c!c   

 1   n
 n c   P0 , n  c
 c!c   
Pn   n
1 
 n !    P0 ,0  n  c
  
To find P0

Since P
n0
n 1
c 1 
 P  P
n 0
n
n c
n 1
n n
c 1
1  
1 
    P0     P0  1
n 0 n !    n c n !   

 c 1 1   n 
1  
n

 P0      n c     1 ---------(1)
 n 0 n !    n  c c !c    
Consider
n n

1  1    
     
n c c !c n  c  c !c c n c   c 
1       
c c 1 c2
  
           ...
c !c  c   c    c   c  

1              
c 1 2 3

    1           ...
c !c  c   c     c    c    c  
1
   
c
1   
   1   
c !c  c  c     c 

St. Joseph’s College of Engineering Page No 5

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

c 1
1     c   
    
c !c  c  c   c 
n c

1  1     c 
     
n c c !c n  c  c !c c   c    c   
1
 c 1 1   n 
1 
n

(1)  P0          
 n 0 n !    
n c
n  c c !c 
1
 c 1 1   n 1      c 
c

 P0         
 n 0 n !    c !c  c   c    c    
To find the average number of customer in the system:  Ls 

Ls  Lq 

Where
Lq  Average number of customer in the queue

Lq   (n  c) Pn
n c
n

1 
Lq   (n  c)   P0
nc c !c n c 
n
1 
  
 P  (n  c)  
 c 
c 0
c !c n c

1    
c 1
  
c2
  
c 3

 P  0  ( c  1  c )    ( c  2  c )    ( c  3  c )    ...
c !c  c   c   c   c 
0


    
c 1 1 2
1      
 c 0 
P  1  (2)    (3)    ...
c !c   c    c   c  
c 1 2
1      
 P0   1   c 
 c 
c
c !c  
c 1 2
1    
Lq    1   c  P0
c c!     
c 1 2
 1     
 Ls  Lq     1   c  P0  
 c c!     
4. In a cinema theatre people arrive to purchase tickets at the average rate of 6 per minute and it takes 7.5
seconds on the average to purchase a ticket. If a person arrives just 2 minutes before the picture starts
and it takes exactly 1.5 minutes to reach the correct seat after purchasing the ticket.
i) Can he expect to be seated for the start of the picture?
ii) What is the probability that he will be seated when the film starts?
iii) How early must he arrive in order to be 99% sure of being seated for the start of the
picture? (Nov/Dec’14)
Solution:

St. Joseph’s College of Engineering Page No 6

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

Model identification:
since there is only one counter and the arrival of persons is infinite, capacity of the system is infinie. Hence
this problem comes under the model (M/M/1);(  /FCFS).
Given Data:
Arrival rate   6 per min
1 60
Service rate   per sec     8 per min
7.5 7.5
i) Expected total time required to purchase the ticket and to reach the seat
=waiting time in the system + time to reach the seat = Ws  1.5 .
1 1 1
Where Ws     0.5
  86 2
Expected total time required to purchase the ticket and to reach the seat =0.5+1.5=2 min
ii) P(he will be the seated for the start of the picture)
=P(Total time < 2 min)
 1  1
1
 (86)
 P  Ws    1  P Ws    1  e (   )t  1  e 2
 0.63
 2   2 
iii) Suppose t minutes be the time of arrival so that he is seated 99%, then
P(W  t )  0.99
 1  P(W  t )  0.99
 P(W  t )  1  0.99  0.01
e(   )t  0.01  e2t  0.01  2t  log(0.01)  t  2.3
This is the waiting time in the system. that is to purchase ticket.
He takes 1.5 minutes to reach the seat after purchasing ticket.
 total time = 2.3+1.5=3.8
Hence he must arrive atleast 3.8 minutes earlier so as to be 99% sure of seeing the start of the film.
5. There are three typists in an office. Each typist can type an average of 6 letters per hour. If letters arrive
for being typed at the rate of 15 letters per hour,
(a) What fraction of the time all the typists will be busy?
(b) What is the average number of letters waiting to be typed?
(c) What is the average time a letter has to spend for waiting and for being typed.
(d) What is the probability that a letter will take longer than 20 min waiting to be typed and being
typed? Assume that arrival and service rates follow poisson distribution.
(May-June’13), (May/June’12), (Nov/Dec’11), (Nov/Dec’10)
Solution:
This is an (M / M / c) : ( / FCFS) model.
  2.5
  15 / hr. &   6 / hr, c  3,   2.5 &     0.833
 c 3
(a) All the typists will be busy if there are at least 3 customers (letters) in the system
p(n  3)  p(3)  p(4)  p(5)  .....  1  p0  p1  p 2 
1
 c 1 1   n 1      c 
c

 P0            0.0449
 n 0 n !    c !c  c   c    c    
 2 1
P0   2.5 P0
2
P1  P0  2.5P0 , P2 
1!  2!  2
2

St. Joseph’s College of Engineering Page No 7

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

P(n≥3) = 1 – [1 + 2.5 + (2.52/2)].(.0449)= 1-0.2974625= 0.7025375= 0.7025

(b) Waiting to be typed (queue)

c 1 2
1    
(c) Lq    1   c  P0
c c!     
1
Lq   2.54 P0  3.5078
3 6
1  1
(c) Ws   Lq    3.5078 2.5  0.4005 hr.
   15
   s    t  s 1  
  
   1  e  
 P0 
      
d ) P(W  t )  e  t 1  
     
s !1   s  1    
   s  
 
 
  2.5  1  e
  (0.0449) 
3 ( 2)( 0.5)

1
6
d ) P(W  t )  e 3
1    0.4616
 2.5 


6 1    0.5  

  3  
6. A TV repairman finds that the time spend on his job has an exponential distribution with mean 30
minutes. If he repair sets in the order in which they come in and if the arrival of sets is approximately
Poisson with an average rate of 10 per 8 hour day.
a) Find the repairman’s expected idle time on each day?
b) How many jobs are ahead of average set just brought? (Nov/Dec’13)
asst(May/June’12)
Solution:
Model identification:
since there is only one repair man and the capacity of the system is infinity. Hence this problem comes under
the model (M/M/1);(  /FCFS).
Given Data:
Arrival rate   10 per 8hr day
1 1
Service rate  30    per min
 30
 (i.e)   8  2  16 per 8hr day
 10 6 3
i) The repairman’s idle time = P0  1   1   / day
 16 16 8
3
The Expected idle time = 8   3 hrs
8
 10
ii) The average number of jobs in the system = Ls    1.667 2 jobs.
  16  10
Another method:

St. Joseph’s College of Engineering Page No 8

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

10 5
Arrival rate    per hr
8 4
1
Service rate   per min
30
60
(i.e)    2 / hr
30
 10 6 3
i) The repairman’s idle time = 1   1  
 16 16 8
3
The Expected idle time each day = 8   3 hrs
8
ii) Number of the jobs ahead of the
average set brought in = The average number of jobs in the system
5
 4
= Ls    1.667 2 jobs.
  2
5
4
7. A group of engineers has two terminals available to aid their calculations. The average computing job
requires 20 minutes of terminal time and each engineer requires some computation one in half an hour.
Assume that these are distributed according to an exponential distribution. If there are 6 engineers in the
group, find
a) the expected number of engineers waiting to use the terminals in the computing center.
b) the total time lost per day.
Solution:
Since there are 2 terminals, also since there are 6 engineers in the group, the capacity of the system is finite.
Hence this problem comes under the model (M/M/c);(k/FCFS)
Given data:
1
Arrival rate   =2 per hr
1/ 2
1 60
Service rate   per min (i.e)    3 per hr.
20 20
Number of servers c  2
Capacity = k = 6
Expected number of engineers waiting to use in the computing center = Ls

Ls  Lq 

1
 c 1
1 
n
1 
c k   n  c 
Where P        
0  n  0 n !     
c!    nc   c

 
 
1
 1 1 2 n 1 2 2
    6  2 n  2 
P            
0 n  0 n !  3  2!  3  n2  3  2  
 

St. Joseph’s College of Engineering Page No 9

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

1
 2 2 3 4 
2 1   
2 1  
1  
1   
1
= 1      1             0.5003
 3 2  3  3  3  
3  3  
  

 
c
 1  
And    L   1 -  k - c - (k - c)(1 -  )  k - c P
c 3 q    c !(1 -  )2 0
1
2  62 62
2 3  1  1  1  
L     
1 - - (6  2)  1 -     (0.5003)  0.0796
q 3 2  3  3 3
 1  
2!1 -   
 3 
 c 1   1 
Effective arrival rate     c   (c  n) P   3  2   (2  n) P 
n n
 n  0   n0 

   3 2   2P0  P1  where P    P
1  0
  2 
   3  2   2  0.5003   0.5003    1.9976
  3 
Expected number of engineers waiting to use in the computing center = Ls
 1.9976
Ls  Lq   0.0796   0.7455
 3
8. Consider a single server queueing system with Poisson input, exponential service times. Suppose the mean
arrival rate is 3 calling units per hour, the expected service time is 0.25 hours and the maximum
permissible number of calling units in the system is two. Find the steady state probability distribution of
the number of calling units in the system and the expected number of calling units in the system.
Solution:
Model identification:
since there is only one server and the maximum number of calling source is 2, capacity of the system is finite.
Hence this problem comes under the model (M/M/1);(k/FCFS).
Given Data:
Arrival rate   3 per hr
1 1
Service rate    per hr (i.e)   4 per hr
0.25 1/ 4
Capacity of the system k  2
 3
    0.75
 4
i) Steady state Probability distribution of the number of calling units is

Pn , n  0 (i.e) To find P0 , P1 , P2
(1   )  n (1  0.75)(0.75) n
Pn    (0.4324)(0.75)n
1  k 1
1  0.753

P0  (0.4324)(0.75)  0.4324
0

P1  (0.4324)(0.75)1  0.3243

St. Joseph’s College of Engineering Page No 10

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

P2  (0.4324)(0.75)2  0.2432
ii) The average number of calling units in the system is
k 1

(k  1)  
Ls 


(k  1)  k 1
since    (or) Ls 

 
1  1   k 1   
k 1

1  

0.75 (2  1)(0.75)3
Ls    0.81
1  0.75 1  (0.75)3
Another method to find Ls :
k 2
Ls   nPn   n(0.43)(0.75)n  0.43 0  0.75  2(0.75)2   0.81
n 0 n 0
9. A bank has two tellers working on savings accounts. The first teller handles withdrawals only while the
second teller handles deposits only. It has been found that the service time distribution for the deposits
and withdrawals both is exponential with mean service time 3 minutes per customer. Depositors are
found to arrive in a Poisson fashion throughout the day with mean arrival rate 16 per hour. Withdrawers
also arrive in a Poisson fashion with mean arrival rate of 14 per hour.
i) What would be the effect on the average waiting time for depositors and withdrawers if each
teller could handle both withdrawals and deposits?
ii) What would be the effect if this could only be accomplished by increasing the service time to
3.5 minutes?
Solution:
1
Case(i) :Given  3 min    20 / hr

Average waiting time in the
Depositors Withdrawers
queue

When there is a separate 1 16 2 14

Wq   Wq  
channel then for the    1  2020  16     2  20  20  14 
(i)depositors 1  16 / hr 1 7
 hr (or ) 12 min  hr (or ) 7 min
(ii)withdrawers  2  14 / hr 5 60
If both tellers do the service
then s=2,   20 / hr s

  1 2  30 / hr 1 1 
  .P0
1 1 1.52 . 1  0.45 h or 3.86 min
Wq  . .  . .
 s.s!  
2
20 2.2 1  .75 2 7 7

 s 
1
 
Where
1
 
 s 1 
 1  n
 s
1 
p0   
 n  0 n !  n s s !   
 1  s  
  

St. Joseph’s College of Engineering Page No 11

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

1

 1  1.5 
1.52   1

 2  0.25  7
Hence if both tellers do both types of service, the customers get benefited as their waiting time is considerably
reduced.
Case (ii): If both tellers do both types of service with increased service time then
60 120
s=2,    / hr ,   1 2  30 / hr
3.5 7
1
 

P0  1  1.75 
1.75   1
2

1  15
 2x 
 8 

s

  .P0
1 1.75 
2
1 1  7 1 2.86
Wq  . .  . . .  h or 11.44 min
 s.s!   
2
120 2.2  7 
2
15 15
1  s  1  
   8
So, if this arrangement is adopted, withdrawers stand to lose as their waiting time is increased considerably and
depositors get slightly benefited.
10. A one person barber shop has 6 chairs to accommodate people waiting for a haircut. Assume that
customers who arrive when all the 6 chairs are full leave without entering the barber shop. Customers
arrive at the rate of 3 per hour and spend an average of 15 minutes in the barber’s chair. Compute
1) the probability that a customer can go to the barber’s chair without waiting.
2) the average waiting time in the queue and in the system.
3) the average number of customers in the system and in the queue.
4) the probability that there are seven customers in the system. (May/June 2016)
Solution:
Model identification:
since there is only one barber and the capacity of the system is finite. Hence this problem comes under the
model (M/M/1);(k /FCFS).
Given Data:
Arrival rate   3 / hr
1  3
Service rate    60  4 / hr per min , k=6+1=7     0.75
15  4
1) The probability that a customer can go to the barber’s chair without waiting
(1   )
= P0  , if   
k 1
1 
3
1
P0  4  0.2778
8
3
1  
4

St. Joseph’s College of Engineering Page No 12

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

L
2) The average waiting time in the queue Ws  s
'
 (k  1)  k 1
Where Ls   , if    and     1  P0 
1  1   k 1

   4 1  0.2778  2.89
0.75 8(0.75)8
Ls    3  0.89  2.11
1  0.75 1  (0.75)8
2.11
The average waiting time in the System Ws 
 0.73
2.89
Ls 1 1
The average waiting time in the System Wq    0.73   0.417
'  3
3) The average number of customers in the system= Ls  2.11  2
 2.89
The average number of customers in the queue = Lq  Ls   2.11   1.387
 4
4) The probability that there are seven customers in the system
 (1   ) 
Pn   n    n P0 if   
 1   k 1 
 
P7  (0.75)7 (0.2778)  0.0371

11. Derive Ls , Lq , Ws & Wq for queues with impatience customer, where the arrival rate is inversely
propotional to the number of customers in the system.
Solution:

Take n  bn   , n  0,1, 2,...
n 1
And n   , n  1, 2,3,...
1
P0  
  ...
1   0 1 n 1
n 1 1  2 ... n

1

              
        
1              ...
1 1 2 1 2 3
  

St. Joseph’s College of Engineering Page No 13

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

1
 2 3
  
  
1           ...
1! 2! 3!
1 
    where,    1
  
e  

P0  e  where,   1

Now,
01...n1
Pn  P0 , n  1, 2,3,....
12 ...n
 1 1 1 n
Pn  P0  n 1   ...    e  , n  0,1, 2,3,...
 2 3 n n!


Ls   nPn   
n 1 



Lq   (n  1) Pn   e   1
n 1 
By Little's formula,

L  
Ws  s   2
  


 e  1
Lq    e 1
Ws   
  
12. Arrivals at a telephone booth are considered to be Poisson with an average time of 12 min. between one
arrival and the next. The length of a phone call is assumed to be distributed exponentially with mean 4
min.
(a) Find the average number of persons waiting in the system.
(b) What is the probability that a person arriving at the booth will have to wait in the queue?
(c) What is the probability that it will take him more than 10 min. altogether to wait for the phone and
complete his call?
(d) Estimate the fraction of the day that the phone will be in use.
This is an infinite queueing model with single server
1 1
Arrival rate   / min. , Service rate  = / min.
12 4
1
 12
(a) Ls    0.5 customer
  1 1

4 12
(b) P(n > 0) =1 - P (n = 0) = 1 - P (no customer in the system) = 1- p 0

St. Joseph’s College of Engineering Page No 14

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

1
   1
= 1  1     12 
   1 3
4
(  )10 5
3  0.1889
(c) P(Ws > 10) = e =e
 2
(d) P(phone will be idle) = P(n = 0) = Po = 1  
 3
2 1
.· P (Phone will be in use) = 1  
3 3
13. Customers arrive at a one man barber shop according to a poisson process with a
mean inter arrival time of 20 min. Customers spend an average of 15 min. in the barber chair, then
(a) What is the probability that a customer need not wait for a hair cut ?
(b) What is the expected no. of customers in the barber shop and in the queue?
(c) How much time can a customer expect to spend in the barber shop?
(d) Find the average time that the customers spend in the queue.
(e) What is the probability that there will be 6 or more customers waiting for service?
1 1
This is an infinite queueing model with single server   / min. and   / min.
20 15
1
 1
(a) p(n  0)  1   1  20  ,
 1 4
15
 1  3 9
(b) Ls   20
 3, Lq  Ls   3    2.2
   115  120  4 4
1 1
(c) Ws    60min.
 1  1
15 20
1
 20
(d) Wq    45 min .
 (   ) 1  1 1 
  
15  15 20 
6

6  1 
(e) p(n  6)      20   0.1779
  1 
 15 
14 A two person barber shop has 5 chairs to accommodate waiting customers. Potential customers, who
arrive when all 5 chairs are full, leave without entering shop . Customers arrive at average rate of 4 / hr
and spend average of 12 min. in the barber chair. Compute p0 , p1 , p7 , and Lq
This is an (M / M / 2) : (7 / FIFO)
1  4  4
  4 / hr,   / min.  5 / hr, s  2, k  7,   0.8,     0.4
12  5 s 2  5

St. Joseph’s College of Engineering Page No 15

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

1  s 1 1 n  s k      1 1 n 2 7    
ns n2

            
p0  n 0 n !  n  s s ! n s  s    n 0 n !  n  2 2! n2  s  
(a)
   


1
 

 1  (0.8)  (0.8) 2 (0.4) 0  (0.4)1  (0.4) 2  (0.4)3  (0.4) 4  (0.4)5   2.311488
2 
1
 p0   0.4289
2.311488
1

(b) p1    p0  0.3431
1


1!

7

(c) p7  n  s   p0  5 0.8 0.4289  0.0014
1 1 7

s s!   2 2!
s
 
(d) Lq  p0   1  k s  (k  s)(1  )k s   0.1462
2 

  s !  
1  
15 Derive p0 , Ls , Lq ,Ws ,Wq for (M / M / 1) : ( / FIFO ) queueing model.
0 1 2 ......n1   .......n times
By birth and death process p n  p0  p0
 0 1  2 .... n1   ........n times
n    n & n    n
n
n 
 p0    p0
 n

p0  p1  p2  .........  1
2 3
  
 p0  p0    p0    p0  ......  1
 
  
       2   3 
 p0 1           .........   1
    
 
1
  
 p0 1    1  p0  1 
  
To find Ls :
2 3
  
Ls  E(N)   n p n  0.p 0  1.p1  2.p 2  ........  1. p 0  2.   p 0  3   p 0  .......
  
 
2 2 2
        
 p0 . 1  2.  3.    .......   p 0 . 1    1   . 1   
    
       
To find Lq , Ws , Wq
Using Littlle’s formula
   2 L
L q  Ls     , Ws  s 
1
   (   )  

St. Joseph’s College of Engineering Page No 16

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

16 A car service station has 2 bays offering service simultaneously. Because of space constraints, only 4 cars
are accepted for servicing. The arrival pattern follows poison distribution with 12cars per day. The service
time in both the bays is exponentially distributed with μ=8carsper dayper bay .Find the average number
of cars in the service station, the average number of cars waiting for service and the average time a car
spends in the system.
This is a multiple server model with finite capacity.
Arrivalrateλ=12/day and Service rate μ=8/day ,S=2,K=4
1
 
 s 1 n s ns  1
1 1 k
  1.5 1 2 
p0              1   1.5  1   0.75    0.75   
2

 n  0 n!    s !    n  s      1 2  
 
 
s
  
P0  0.1960 ,   , Lq  P0   1   k  s   k  s 1     k  s 
2 
s    s !1   

 0.75 
Lq =0.1960 1.5  2  
 1- 0.75 -2  0.25 0.75   =0.4134car.
2 2 2

 2  0.25  
 
s 1 1
Ls =Lq  s   s  n  pn  0.4134  2  2  n  pn  2.4134  2  2 p0  p1   1.73cars.
n 0 n 0

Ls  s 1

Ws = where     s    s  n  pn   8  2   2 p0  p1    10.512
  n 0 
1.73
Ws   0.1646 day
10.512
Average time that a car has to spend in the system = 0.16
17 Patients arrive at a clinic according to Poisson distribution at the rate of 30 patients per hour. The waiting
room does not accommodate more than 14 patients. Examination time per patient is exponential with a
mean rate of 20 per hour.
(a) Find the effective arrival rate at the clinic.
(b)What is the probability that an arriving patient will not wait?
(c)What is the expected waiting time until a patient is discharged from the clinic?
Arrivalrate   30/ hr., Servicerate  20/ hr. , M / M /1: K / FIFO model.
1- λ 1- 3
μ
   , p0  = 2 =0.00076
 
16
k+1
1- λ  
μ
1- 3
2

(a) The effective arrival rate is    1  p0   20 1  0.00076   19.98hr.

(b) P  a patient will not wait   p  n  0   p0  0.00076

St. Joseph’s College of Engineering Page No 17

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

K 1
  3
16

 K  1   16  
  
 (3)    16  13patients
2
(c) Ls  
  
K 1
3
1   1  
 2
L 13
Ws  s   0.65hr or 39min.
  19.98
18 A Telephone exchange has two long distance operators. The telephone company finds that during the peak load,
long distance calls arrive in a Poisson fashion at an average rate of 15 per hour. The length of service on these
calls is approximately exponentially distributed with mean length 5 minutes.
(1) What is the probability that a subscriber will have to wait for his long distance call during the peak hours of
the day?
(2) If the subscribers will wait and are serviced in turn, what is the expected waiting time?
Solution:
Model identification: Since there are two operators, infinite capacity.
Hence this problem comes under the model (M/M/c);(  /FCFS).
Given data:
Arrival rate   15 / hr
1
Service rate   per min
5
60
(i.e)    12 per hr
5
Number of servers c  2
1
 c 1 1   n c  
c

w.k.t P0         
 n 0 n !    c !(  c   )    
1
 1 1  15 n 2 12  15  
2

P0        
 n 0 n !  12  2!((2 12)  15)  12  
1
 1 1 24 2
  1.25  1.25 
n

 n 0 n ! 18 
1
 1 1 
  1.25  2.078
n

 n 0 n ! 
P0  (1  1.25)  2.078  4.3281  0.2311
1

i) the probability that a subscriber will have to wait for his service is
c
 15 
c

  
P( N s  2)    P( N s  c)   
12
(0.2311) P0
 15 
2!1  
  
c !1  
 24   c 
1.25
2

P( N s  2)  (0.2311)  0.4814
0.75

St. Joseph’s College of Engineering Page No 18

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

ii) If the subscriber will wait and are serviced in turn then the expected waiting time
Lq 1
Ws  
 
c 1 2
1    
Where Lq    1   P0
c.c !     c 
2

1.25 1   (0.2311)

1 3 15

(2)2!  24 
2

1.25 1   (0.2311)

1 3 15

4  24 
 1.953 7.111 0.2311  3.209
Lq 1 3.209 1
Ws      0.1368 hr
  15 12
19 People arrive at a theatre ticket booth in Poisson distributed arrival rate of 25 per hour. Average service
time is 2 minutes following exponential distribution. Calculate (1) the mean number in waiting line (2) the
mean waiting time (3) the utilization factor.
1  25
Soln.   25 per hour ,    60  30 per hour ,     0.833
2  30
2
(1) Length of queue Lq   4 (appr.)
1 
Lq
(2) Mean waiting time   9.6 min

(3) Utilisation factor    0.833
20 Trains arrive at the yard every 15 minutes and the service time is 33 minutes. If the line capacity of the yard is
limited to 5 trains, find the probability that the yard is empty and the average number of trains in the system,
given that the inter arrival time and service time are following exponential distribution.
Solution:
Model identification:
since there is only one server and the maximum number of calling source is 2, capacity of the system is finite.
Hence this problem comes under the model (M/M/1);(k/FCFS).
Given Data:
1
Arrival rate   per min
15
1
Service rate   per min
33
Capacity of the system k  5
 33
   2.2
 15

St. Joseph’s College of Engineering Page No 19

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20


1
 1  1  2.2
i) Probability that the yard is empty  P0     0.01068

k 1
1  k 1
1  2.26
1  

ii) Average number of trains in the system:
k 1

(k  1)  
 (k  1)   
k 1
Ls   since    (or) Ls  
1  1  k 1
  
k 1

1  

2.2 (5  1)(2.2)6  680.28 
Ls    (1.8333)     4.221
1  2.2 1  (2.2) 6
 112.37 
Another method to find Ls :
5
Ls   nPn  P1  2 P2  3P3  4P4  5P5
n 0

Ls   P0  2 2 P0  3 3 P0  4 4 P0  5 5 P0
Ls  P0    2 2  3 3  4 4  5 5 
Ls  P0    2 2  3 3  4 4  5 5 
 0.01168 2.2  2  2.22  3  2.23  4  2.24  5  2.25 
Ls  4.221
21 Self service system is followed in a super market at a metropolis. The customer arrivals occur according
to a Poisson distribution with mean 40 per hour. Service time per customer is exponentially distributed
with mean 6 minutes. Find the expected number of customers in the system and what is the percentage
of time that the facility is idle?
Solution:
Model identification:
It is self service model and the customer himself is treated as server. The number of server is unlimited . Hence
this problem comes under the model M/M/  queues.
Given Data:
Arrival rate   40 per hr
1
Service rate   per min
6
60
(i.e)    10 / hr
6
i) The average (Expected) number of customer in the system
 40
Ls    4 customer
 10


ii) P( the facility is idle) = P0  e   e4  0.0183
Percentage of idle facility = 0.0183x100=1.83%

St. Joseph’s College of Engineering Page No 20

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

22 A telephone exchange receives one call every 4 minutes and connects one call every 3 minutes. If the rate of
arrival follows Poisson distribution and the service time follows exponential distribution find the average waiting
time for a call in the queue and in the system.
Model identification:
since there are one server and the capacity of the system is infinity. Hence this problem comes under the
model (M/M/1);(  /FCFS).
Given Data:
1
Arrival rate   per min
4
1
Service rate   per min
3
i) The average waiting time for a call in the System
1 1
Ws    12 min
  1  1
3 4
ii) The average waiting time for a call in the queue
1
Wq  Ws   12  3  9 min

23 A petrol pump has two pumps. The service times follow the exponential distribution with mean 4 minutes
and cars arrive for service in a Poisson process at the rate of 10 cars per hour. Find the probability that
a customer has to wait for service and what is the probability that the pumps remain idle?
Solution:
Model identification: Since the petrol bunk has 2 pumps, infinite capacity.
Hence this problem comes under the model (M/M/c);(  /FCFS).
Given data:
Arrival rate   10 per hr
1 60
Service rate   per min (i.e)    15 per hr.
4 4
Number of servers c  2
1
 c 1 1   n c  
c

w.k.t P0         
 n 0 n !    c !(  c   )    
1
 1 1  10 n 2 15  10  
2

P0        
 n 0 n !  15  2!((2 15)  10)  15  
1
 1 1 30 2
   0.6667    0.6667  
n

 n 0 n ! 40 
1
 1 1 
   0.6667   0.3333
n

 n 0 n ! 
P0  (1  0.6667)  0.3333  21  0.5
1

i) The probability that a customer has to wait for the service is

St. Joseph’s College of Engineering Page No 21

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

c
 10 
c

   
 15   
P( N s  2)  (0.5) P( N s  c)  P0
 10    
2!1   c !1  
 15  2   c 
 0.6667 
2
1
P( N s  2)  (0.5)   0.1667
1.3333 6
 10 1
ii) Probability of time that a pump is busy     
c 2  15 3
 Probability of time when a pump is idle = 1- Probability of time that a pump is busy
1 2
= 1 
3 3
2
 Percentage of idle time of for each pump   100  67%
3
24 A shipping company has a single unloading dock with ships arriving in a Poisson fashion at an average
rate of 3 per day. The unloading time distribution for a ship with n unloading crews is found to be
1
exponent with average unloading time days. The company has a large labour supply without regular
2n
working hours, and to avoid long waiting times, the company has a policy of using as many unloading
crews as there are ships waiting in line or being unloaded. Find the average number of unloading crews
working at any time and the probability that more than 4 crews will be needed.
Solution:
Arrival rate   3 ships/day
1
Service rate n  n   2n    2 ships/day for one unloading crew.
1 / 2n
 3
i) Expected number of unloading crews is equal to the number of ship in the system Ls    1.5
 2
 n

 1 
ii) Pn  e   n  0,1, 2,3,..
n!   
1.5
n
1.5
Pn  e , n  0,1, 2,3,...
n!
P( more than 4 crews will be needed)
= P( atleast 5 ships in the system)
1.5
n
4 4
 P( N  5)  1   Pn  1   e 1.5

n 0 n 0 n!
 1.5 1.5 1.5 
4 2 3
1.5
 1  e 1  1.5    
 2! 3! 4! 

 1  0.22311  1.5  1.125  0.5625  0.2109
 1  0.98129  0.0187
25 Explain Markovian Birth - Death process and obtain the expressions for steady state probabilities.
Markovian Birth - Death process:

St. Joseph’s College of Engineering Page No 22

Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

Let n be the size of the customer at time t.

Let Pn (t ) be the probability of n customers in the system at t.
Let n  average arrival rate when n customers are in the system.
n  average service rate when n customers are in the system
Now,
Pn (t  t ) is the probability of n customers at time t  t
The presence of n customers in the system at time t  t can happen in any one of the following four
mutually exclusive ways:
i) Presence of n customers at time t and no arrival or departure during t time.
ii) Presence of n-1 customers at time t and one arrival and departure during t time.
iii) Presence of n+1 customers at time t and no arrival and one departure during t time.
iv) Presence of n customers at time t and one arrival and one departure during t time.
Pn (t  t )  Pn (t )(1  n t )(1  n t )  Pn 1 (t )n 1t (1  n 1t )
 Pn 1 (t )(1  n 1t ) n 1t  Pn (t ) n t n t
i.e., Pn (t  t )  Pn (t )  (n  n ) Pn (t )t  n1Pn1 (t )t  n1Pn1 (t ) , on omitting terms containing (t )2
which is negligibly small.
Pn (t  t )
  n1Pn1 (t )  (n  n ) Pn (t )  n 1Pn 1 (t )    (1)
Pn (t )
Taking limits on both sides of (1) as t  0, we have
Pn (t )  n1Pn1 (t )  (n  n ) Pn (t )  n1Pn1 (t )    (2)
Equation (2) does not hold good for n=0, as Pn 1 (t ) does not exists.
Hence we derive the differential equation satisfied by P0 (t ) independently.
Proceeding as before,
P0 (t  t )  P0 (t )(1  0t )  P1 (t )(1  1t )1t
[ by the possibilities (i) and (iii) given above and as no departure is possible when n=0]
P0 (t  t )  P0 (t )
 0 P0 (t )  P1 (t ) 1    (3)
t
Taking limits on both sides of (3) as t  0 , we have
P0 (t )  0 P0 (t )  P1 (t )1    (4)
Now in steady state, Pn (t ) and P0 (t ) are independent of time and hence Pn (t ) and P0(t ) become zero.
Hence the differential equation (2) and (4) reduce to the difference equations
n1Pn1  (n  n ) Pn  n1Pn1  0      (5) and
0 P0  1P1  0      (6)
To find steady state probabilities
From eqn (6) derived above, we have
0
P1  P      (7)
1 0
Putting n=1 in (5)
2 P2  (1  1 ) P1  0 P0

St. Joseph’s College of Engineering Page No 23

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

0
 (1  1 ) P  P
1 0 0 0
01
 P
1 0

P2  0 1 P0
12
Successively putting n=1,2,3,.... in (5) and proceeding similarly, we can get
012
P3  P etc.
12 3 0
   ....n1
Finally Pn  0 1 2 P n  1, 2,3,....
12 3 ....n 0
Since the number of customers in the system can be 0 or 1 or 2 or 3 etc., which events are mutually exclusive

and exhaustive, we have P
n 0
n 1

012 ....n1
i.e., P0      ....
n 1
P0  1
1 2 3 n

1
P0  
012 ....n 1
    ....
n 1 1 2 3 n
26 An airport has a single runway. Airplanes have been found to arrive at the rate of 15 per hour. It is
estimated that each landing takes 3 minutes. Assuming a Poisson process for arrivals and an
exponential distribution for landing times. Find the expected number of airplanes waiting to land,
expected waiting time. What is the probability that the waiting time will be more than 5 minutes?
(NOV/DEC 2017)
Solution:
Model identification:
since there is only one single runway and the capacity of the system is infinity. Hence this problem comes
under the model (M/M/1);(  /FCFS).
Given Data:
15 1
Arrival rate   15 / hr     0.25min
60 4
1 1
Service rate  3min     0.3333min
 3
i) The expected number of airplanes waiting to land is
2 1/16 9
Lq     2.25
 (   ) 1  1 1  4
  
33 4
ii) Expected waiting time of the airplanes is
 1/ 4
Wq    9 min
 (   ) 1  1 1 
  
3 3 4
iii) Probability that the waiting time of a customer in the queue exceeds t is

St. Joseph’s College of Engineering Page No 24

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

  (   ) t
P(Wq  t )  e

1 1 1
1/ 4  3  4  3  12 
P(Wq  5)  e  e  1.226
1/ 3 4
27 Let there be an automobile inspection situation with three inspection stalls. Assume that cars wait in
such a way that when a stall becomes vacant, the car at the head of the line pulls up to it. The station can
accommodate almost four cars waiting at one time. The arrival pattern is Poisson with a mean of one
car every minute during the peak hours. The service time is exponential with a mean of 6 minutes. Find
the average number of customers in the system during the peak hours, the average waiting time and the
average number per hour that cannot enter the station because of full capacity. (NOV/DEC 2017)
Solution:
Since there are 3 inspection stalls, also since there are 4 cars in the group, the capacity of the system is finite.
Hence this problem comes under the model (M/M/c);(k/FCFS)
Given data:
Arrival rate   1 per min
1
Service rate   per min
6
Number of servers c  3
Capacity = k = 4+3=7
Expected number of engineers waiting to use in the computing center = Ls

Ls  Lq 

1
 c 1 n c nc
 1  1 k    
Where P0       
 n  0 n!    
c!    n  c   c  
 
1
 2 1 n 1 2 7 n  3
P  
0  n  0 n!
 6   6   2 
 3! n3 
1
 1  6  18  6 1  2  4  8  16 
  25  186  0.00474
1

P0  0.00474

And   2
c
Expected number of cars in the queue

 
c
 
L   1 -  k - c - (k - c)(1 -  )  k - c P
q    c !(1 -  )2 0

  6
3 2
3!1- 2 
2 1-  27  3 - (7  3) 1- 227  3(0.00474)
 72 1  16  64  (0.00474)  1.67
L  1.67
q

St. Joseph’s College of Engineering Page No 25

 Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

 c 1  1 2 
Effective arrival rate     c   (c  n) P   3   (3  n) P 
n 6  n  0 n
 n  0   
 1 1
2 3
1
   3   3P0  2 P1  P3  where P1  
 P0 ; P2    P0 ; P2    P0
6  2!    3!   
1 2 1 3
P1  6(0.00474); P2   6  (0.00474); P3   6  (0.00474)
2 6
P1  0.0284; P2  0.0853; P3  0.1706
1
   3   3(0.0284)  2(0.0853)  0.1706   0.4289
6
   0.4289
Expected number of cars in the system = Ls

Ls  Lq   1.67   0.4289  (6)  4.24

Ls  4.24 cars
Lq 1 1.67
Expected waiting time in the system Ws     6  9.8 min
   0.4289
Expected no. of cars per hr that cannot enter the station is
 1  
 1 
n

P7  60   73  6  (0.00474   60  163.8

7
Pn   nc   P0 , n  c  k
 3!3   c!c   

28 Show that for a single service station, Poisson arrivals and exponential service time, the probability that
exactly n calling units in the queueing system is Pn  (1  e) en , n  0 where e is the traffic intensity.
Also, find the expected number of units in the system. (NOV/DEC
2017)
Solution:
Let n be the size of the customer at time t.
Let Pn (t ) be the probability of n customers in the system at t.
Let n  average arrival rate when n customers are in the system.
n  average service rate when n customers are in the system
Now,
Pn (t  t ) is the probability of n customers at time t  t
The presence of n customers in the system at time t  t can happen in any one of the following four
mutually exclusive ways:
i) presence of n customers at time t and no arrival or departure during t time.
ii) presence of n-1 customers at time t and one arrival and departure during t time.
iii) presence of n+1 customers at time t and no arrival and one departure during t time.
iv) presence of n customers at time t and one arrival and one departure during t time .
Pn (t  t )  Pn (t )(1  n t )(1  n t )  Pn 1 (t )n 1t (1  n 1t )
 Pn 1 (t )(1  n 1t ) n 1t  Pn (t ) n t n t

St. Joseph’s College of Engineering Page No 26

Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

i.e., Pn (t  t )  Pn (t )  (n  n ) Pn (t )t  n1Pn1 (t )t  n1Pn1 (t ) , on omitting terms

containing (t ) which is negligibly small.
2

Pn (t  t )
  n1Pn1 (t )  (n  n ) Pn (t )  n 1Pn 1 (t )    (1)
Pn (t )
Taking limits on both sides of (1) as t  0, we have
Pn (t )  n1Pn1 (t )  (n  n ) Pn (t )  n1Pn1 (t )    (2)
Equation (2) does not hold good for n=0, as Pn 1 (t ) does not exists.
Hence we derive the differential equation satisfied by P0 (t ) independently.
Proceeding as before,
P0 (t  t )  P0 (t )(1  0t )  P1 (t )(1  1t )1t
[ by the possibilities (i) and (iii) given above and as no departure is possible when n=0]
P0 (t  t )  P0 (t )
 0 P0 (t )  P1 (t ) 1    (3)
t
Taking limits on both sides of (3) as t  0 , we have
P0 (t )  0 P0 (t )  P1 (t )1    (4)
Now in steady state, Pn (t ) and P0 (t ) are independent of time and hence Pn (t ) and P0(t ) become zero.
Hence the differential equation (2) and (4) reduce to the difference equations
n1Pn1  (n  n ) Pn  n1Pn1  0      (5) and
0 P0  1P1  0      (6)
To find steady state probabilities
From eqn (6) derived above, we have
0
P1  P      (7)
1 0
Putting n=1 in (5)
2 P2  (1  1 ) P1  0 P0

 (1  1 ) 0 P0  0 P0
1

 0 1 P0
1

P2  0 1 P0      (8)
12
Successively putting n=1,2,3,.... in (5) and proceeding similarly, we can get
012
P3  P etc.
12 3 0
   ....n1
Finally Pn  0 1 2 P n  1, 2,3,....      (9)
12 3 ....n 0

St. Joseph’s College of Engineering Page No 27

Subject Name & Code: MA 8402 - Probability and Queuing Theory 2019-20

Since the number of customers in the system can be 0 or 1 or 2 or 3 etc., which events are mutually exclusive

and exhaustive, we have P
n 0
n 1

012 ....n1
i.e., P0      ....
n 1
P0  1
1 2 3 n

1
P0       (10)

012 ....n 1

n 1 1 2 3 .... n
Now,
Let N denote the no. of customer in the queueing system
And N is a discrete random variable, which can take the value 0,1,2,3,….
n

Such that P  N  n   Pn    P0 , from equation (9) and (10), we have

1 1 
P0    1


n


n

1     
n 1    n 0   


P0  1 

n
  
Pn    1  
  
The expected number of units in the system
Ls   nPn
n
  
  n   1  
  
n 1
     
 1     n  
     
2
      
 1   1  
      

Ls 
 

St. Joseph’s College of Engineering Page No 28