|
Queuing Model : M/M/1/N
|
Arrival rate `lambda,` Service rate `mu,` Capacity `N`
1. Traffic Intensity
`rho=lambda/mu`
2. Probability of no customers in the system
`P_0=(1-rho)/(1-rho^(N+1))`
3. Probability of N customers in the system
`P_N=rho^N*P_0`
4. Average number of customers in the system
`L_s=rho/(1-rho) - ((N+1)*rho^(N+1))/(1-rho^(N+1))`
5. Effective Arrival rate
`lambda_e=lambda(1-P_N)`
6. Average number of customers in the queue
`L_q=L_s-(lambda_e)/(mu)=L_s-(lambda(1-P_N))/(mu)`
7. Average time spent in the system
`W_s=(L_s)/(lambda_e)=(L_s)/(lambda(1-P_N))`
8. Average Time spent in the queue
`W_q=(L_q)/(lambda_e)=(L_q)/(lambda(1-P_N))`
9. Utilization factor
`U=L_s-L_q`
10. Probability that there are n customers in the system
`P_n=rho^n*P_0`
|
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then
