Professional Documents
Culture Documents
Queuing Theory Equations PDF
Queuing Theory Equations PDF
Definition
λ = Arrival Rate
μ = Service Rate
ρ=λ/μ
C = Number of Service Channels
M = Random Arrival/Service rate (Poisson)
D = Deterministic Service Rate (Constant rate)
M/D/1 case (random Arrival, Deterministic service, and one service channel)
Expected average queue length E(m)= (2ρ- ρ )/ 2 (1- ρ)
2
M/M/1 case (Random Arrival, Random Service, and one service channel)
The probability of having zero vehicles in the systems Po = 1 - ρ
ρ
Note : must be < 1.0
c
−1
ρ ⎡ c −1 ⎛ 1 ⎞ ⎛ ρ c ⎞ ⎤
For =1 Po = ⎢∑ ⎜ ρ n ⎟ + ⎜⎜ ⎟⎟(K − c + 1)⎥
c ⎣ n =0 ⎝ n! ⎠ ⎝ c! ⎠ ⎦
1 n
Pn = ρ Po for 0 ≤ n ≤ c
n!
⎛ 1 ⎞
Pn = ⎜ n -c ⎟ ρ n Po for c ≤ n ≤ k
⎝ c c! ⎠
⎛ρ⎞
Po ρ c ⎜ ⎟ ⎡
⎛ρ⎞ ⎤
k − c +1 k −c
⎝ c⎠ ⎛ρ⎞ ⎛ ρ⎞
E ( m) = 2 ⎢
1− ⎜ ⎟ − ⎜1 − ⎟(k − c + 1)⎜ ⎟ ⎥
⎛ ρ ⎞ ⎣⎢ ⎝ c ⎠ ⎝ c⎠ ⎝ c ⎠ ⎦⎥
c!⎜1 − ⎟
⎝ c⎠
c −1
(c − n ) ρ n
E (n) = E (m) + c − Po ∑
n =0 n!
E ( n)
E (v ) =
λ (1 − PK )
1
E ( w) = E (v) −
μ