Week 4 - Steady State Analysis, Classification Of Queueing Systems And Approximations Flashcards

1
Q

Conditions for steady state behaviour (7)

A

• 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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is state probability (Pn)?

A

Is the probability that there are n customers in the system, meaning the system is in a particular state

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Example of state probability (2)

A

• If you have 2 states the probability would be 1/2
• If you have 3 states the probability would be 1/3
Etc etc

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Formula for state probability

A

1/Ns (Ns is the number of states)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Formula for Ls using Pn + example

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Formula for Lq using Pn

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Formula for Wq using Little’s formula

A

Wq =Lq / λ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is service rate (μ)

A

Is the amount of customer served by time period

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Formula for average service time

A

1/μ
1 / service rate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What do you get when you minus average service time (1/μ) from average time in system (Ws)

A

Average time in the queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Formula for absolute utilisation of a system (ρ)

A

λ/μ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Formula linking Ls, Lq, ρ and λ/μ

A

ρ = Ls - Lq = λ/μ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Formula for proportional utilisation

A

Absolute utilisation / number of servers
ρ/m

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Four characteristics of queueing systems

A

• 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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Markovian distribution (M)

A

Is exponential, typical for poison arrivals

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Gamma distribution (En)

A

Has a shape parameter n and is normally used to describe service process (normal distribution in a bell shape)

17
Q

General distribution (G)

A

Employs approximations and is vastly applicable

18
Q

Potential X1 or X2 distributions

A

• Markovian distribution (M)
• Gamma distribution (En)
• General distribution (G)
• Deterministic distribution (D)

19
Q

Deterministic distribution

A

Values are constant