Week 4 - Steady State Analysis, Classification Of Queueing Systems And Approximations Flashcards
Conditions for steady state behaviour (7)
• Probability distribution for Lq does not depend on time
• The arrival process is stationary
• Service rate is not dependant on time
• Number of servers (m) - constant
• Every server works independently
• One customer is served at one time by each server
• Has a state probability
What is state probability (Pn)?
Is the probability that there are n customers in the system, meaning the system is in a particular state
Example of state probability (2)
• If you have 2 states the probability would be 1/2
• If you have 3 states the probability would be 1/3
Etc etc
Formula for state probability
1/Ns (Ns is the number of states)
Formula for Ls using Pn + example
Formula for Lq using Pn
Formula for Wq using Little’s formula
Wq =Lq / λ
What is service rate (μ)
Is the amount of customer served by time period
Formula for average service time
1/μ
1 / service rate
What do you get when you minus average service time (1/μ) from average time in system (Ws)
Average time in the queue
Formula for absolute utilisation of a system (ρ)
λ/μ
Formula linking Ls, Lq, ρ and λ/μ
ρ = Ls - Lq = λ/μ
Formula for proportional utilisation
Absolute utilisation / number of servers
ρ/m
Four characteristics of queueing systems
• Arrival process A(t) - the pattern of interatrial times
• Service process - S(t) - the pattern of service times
• Number of servers - m
• Queue size/capacity - b
Markovian distribution (M)
Is exponential, typical for poison arrivals