Queuing Theory Form
Uploaded by
ScribdTranslationsQueuing Theory Form
Uploaded by
ScribdTranslationsQUEUEING THEORY FORM
λ: Average customer arrivals K: Number of population
µ: Average service of a customer C: System space capacity
S: Number of servers
MODEL MODEL MODEL MODEL
NOMENCLATURE M/M/1/FIFO/∞/∞ M/M/S/FIFO/∞/∞ (Finite source) M/M/S/DG /C /∞
M/M/S/DG /K /K
ρ: Time spent occupied λ λ ρ=1−P0 λ
average the system ρ= ρ= ρ=
µ sµ µ
[ ]
P 0 : Average idle time of the P0=1−ρ s s s−1 n −1 1 1− ρ
s ρ ( sρ ) P 0= P 0=
System P 0= +∑ k
1− ρ
c+1
s ! (1−ρ) n =0 n! 1+ ∑ C n
n=1
{ } { }
P n : Probability that n customers are
in the system ( sρ )n P0 C
ρ (1− ρ)
; si 0<n< s C+1
; si ρ≠ 1
Pn=(1− ρ) ρ
n
P n= n ! n=0 , 1 ,2 , 3 , … Pn=C n P 0 Pn= 1− ρ
s n
s ρ 1
¿ P ; si n ≥ s ¿ ; si ρ=1
s! 0 C +1
{ }
L: On average the number of clients ρ L=λ W µ ρ [ 1−( C+1 ) ρ +C ρ ]
C C+1
in the system L= L=K − (1−P0 )
1−ρ λ ; si ρ≠ 1
L= ( 1− ρ ) ( 1−ρ ) C+1
C
¿ ; si ρ=1
2
L q : Average number of customers in the ρ
2
S ρ
S S +1
P0 λ+ µ Lq=L−(1−P0)
queue Lq = Lq = Lq=K − (1−P0 )
1− ρ S !(1−ρ)
2 λ
W: Average time spent in 1 1 W =L[( K−L) λ]
−1
1
the system W= W =W q + W =W q +
µ− λ µ µ
W q : Average waiting time in the ρ Lq W q=Lq [(K −L) λ ]
−1
Lq
line W q= W q= W q=
µ−λ λ λef
λ ef : Effective arrivals λ ef =λ( K −L) λ ef =λ(1−PC )
BIRTH AND DEATH PROCESS
λ 0 λ 1 λ 2 … .. λ n 1 Pn=C n P 0
C n= P 0= k
µ0 µ1 µ2 … .. µn
1+ ∑ C n
n=1
∞ ∞ ∞
L=∑ n P n Lq=∑ (n−S)Pn λ ef =∑ λn Pn
n=0 n=s n=0
- Poisson Distribution - Exponential Distribution
n
( λt ) − λt −µt
P n= e P ( T ≤ t ) =1−e
n!
P n: Probability of n arrivals in T time period
- Probability that a customer spends more than t units - Probability that an arriving customer spends more than t
of time in the system units of time in the queue
−t / W
W ( t )=e
−t / W
W q ( t )=ρ e
