Queueing Formulae

Suppose a random variable T is assumed to be exponentially distributed with

parameter 𝛼 if it’s pdf is:
𝑓𝑇 (𝑡) = 𝛼𝑒 −𝛼𝑡 for 𝑡 ≥ 0
Its cumulative probabilities are:

𝑃 (𝑇 ≤ 𝑡) = 1 − 𝑒 −(𝛼𝑡) or 𝑃 (𝑇 > 𝑡) = 𝑒 −(𝛼𝑡)

Let the time between successive arrivals into some system be exponentially
distributed, and let N be the number of arrivals in a fixed interval of time of length
t. Then N (a discrete random variable) has the Poisson distribution
𝑒 −𝜆𝑡 𝜆𝑡 𝑘
P(N = k) = ; E[N] = 𝜆𝑡 ; Var [N] = 𝜆𝑡
𝑘!

M/M/1:
• Probability of 0 customers in the service system: 1 − 𝜌
• Probability of n customers in the service system: (1 − 𝜌) ∗ 𝜌 𝑛
𝜆
• Average number of customers in the system: 𝐿 =
𝜇−𝜆

𝜆2
• Average number of customers in the queue: 𝐿𝑞 =
𝜇∗(𝜇 −𝜆)
1
• Average time a customer spends in the system: 𝑊 =
𝜇−𝜆
𝜆
• Average time a customer spends in the queue: 𝑊𝑞 =
𝜇∗(𝜇 −𝜆)

M/M/C:
Service rate , 𝜇𝑐 = 𝑛𝜇 𝑖𝑓 𝑛 < 𝑐 𝑒𝑙𝑠𝑒 𝑐𝜇 𝑖𝑓 𝑐 ≤ 𝑛
−1
𝜌2
• Probability of 0 customers in the service system: [1 + 𝜌 + 𝜌 ]
2(1 − )
𝑐

1 𝜆 𝑛
• Probability of n customers in the service system: ( ( ) ) 𝑃0 if 𝑛 ≤ 𝑐
𝑛! 𝜇

1 𝜆 𝑐 𝜆 𝑛−𝑐
:( ( ) ( ) ) 𝑃0 if 𝑛 > 𝑐
𝑐! 𝜇 𝑐𝜇
 𝜆
• Average number of customers in the system: 𝐿 = 𝜆𝑊𝑞 +
𝜇

𝜌𝑐+1
• Average number of customers in the queue: 𝐿𝑞 = ((𝑐 ) 𝑃0
−1)!(𝑐 −𝜌)2
1
• Average time a customer spends in the system: 𝑊 = 𝑊𝑞 +
𝜇
𝐿𝑞
• Average time a customer spends in the queue: 𝑊𝑞 =
𝜆

M/M/1/N:
1
 Probability of 0 customers in the service system : 𝑃0 = 𝜌𝑁+1
1− 1−𝜌
1−𝜌
 Probability of N customers in the service system : 𝑃𝑁 = ( ) 𝜌𝑁
1− 𝜌𝑁+1
𝐿𝑞 1
 Average waiting time in queueing system : 𝑊𝑠 = +
𝜆𝑒 𝜇
1
 Average waiting time in queue, 𝑊𝑞 = 𝑊𝑠 −
𝜇
 Average number of customers in the system, 𝐿𝑠
1−(𝑁+1)𝜌𝑁 +𝑁𝜌𝑁+1
=𝜌 ∗( (1 −𝜌)(1 −𝜌𝑁+1 )
) 𝑓𝑜𝑟 𝜌 ≠ 1
𝑁
= for 𝜌 = 1
2
 Average number of customer in the queue, 𝐿𝑞 = 𝐿𝑠 − (1 − 𝑃0 )