Homework 4 Flashcards
Consider an π/π/1 model with π , π , and FIFO queue discipline.
Compute p,π0,pn, πΏ, πΏπ, π, ππ assuming that the queue can be infinitely long and the queue
system is in steady state.
p = π/π
p0 = 1 - p
pn = pp0
L = sum from n = 0 to infinity npn = sum from n = 0 to infinity p0np^n = π/(πβπ) = p/p0
π = 1/(πβπ) = L/π
Lq = πΏ βp
Wq = πΏπ/π
Consider an π/π/s model with π , π , and FIFO queue discipline.
Compute p,π0,pn, πΏ, πΏπ, π, ππ assuming that the queue can be infinitely long and the queue
system is in steady state.
p = cnp0
p0 = (1+sum(from n=1 to infinity) cn)^-1
L = p0sum(from n=0 to infinity) ncn
Lq = p0sum(from n=s to infinity) (n-s)cn
W = L/ π
Wq = Lq/ π
cn for M/M/s/K model
if n<=s: cn= (1/n!)(π/π)^n
if s<=n<=K: cn = (1/s!)(π/π)^2(π/sπ)^(n-s)
n>K: xn= 0
sum from n=0 to infinity for n(x)^n
x/(1-x)^2
sum from n=0 to infinity for (x)^n
1/(1-x)