Queueing systems Flashcards

1
Q

How do continuous time Markov chains differ to discrete time Markov chains

A

in the fact that jumps from one state to another no longer happen at specified intervals but rather at unknown time. The event time is a random variable.

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

What type of distribution do we assign to the random time

A

Exponential

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

Equation for the time spent in a state in a Quang system with 2 options with params n and m

A

e^-(n+m)t

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

When is a poison process in steady state

A

When the rates at which the system enters and leaves state n are equal

Rate of entering a state is calculated by looking at the different states it can enter it from and multiplying the rate at which the process enters the state from there by the proportion of time the process is in that given state (and then summing the different routes).

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

For an arrival rate lambda, what is the expected time between arrivals

A

1/ lambda

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

What is the service rate, mu, and what does 1/ mu represent

A

The expected numb r of customers that can be served by one of the servers per unit time.

The expected service time per customer.

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

Equation for utilisation factor and what is it

A

Rho = lambda / s x mu

S= no servers
Mu = service rate
Lambda = arrival rate 

Represents the fraction of the time we expect the service facility to be busy (i.e., at least one of the servers to be busy).

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

If a continuous random variable has the lack of memory property, what distribution does it have

A

Exponential

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

What’s little’s formula

A

Number of customers in a queue L is equal to arrival rate lambda times the average time in the system

L = λW

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

How to find expected queue length of a s-server system

A

Sum all of the state’s number of consumers i multiplied by the probability shifted up the queue by s (number of servers): p(i + s)

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

For Kendall’s notation what do M, D and G stand for

A

Memoryless (exponential)
Deterministic (not probabilistic)
General (unspecified)

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

How do continuous time Markov chains differ to discrete time Markov chains

A

in the fact that jumps from one state to another no longer happen at specified intervals but rather at unknown time. The event time is a random variable.

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

What type of distribution do we assign to the random time

A

Exponential

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

Equation for the time spent in a state in a Quang system with 2 options with params n and m

A

e^-(n+m)t

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

When is a poison process in steady state

A

When the rates at which the system enters and leaves state n are equal

Rate of entering a state is calculated by looking at the different states it can enter it from and multiplying the rate at which the process enters the state from there by the proportion of time the process is in that given state (and then summing the different routes).

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

For an arrival rate lambda, what is the expected time between arrivals

A

1/ lambda

17
Q

What is the service rate, mu, and what does 1/ mu represent

A

The expected numb r of customers that can be served by one of the servers per unit time.

The expected service time per customer.

18
Q

Equation for utilisation factor and what is it

A

Rho = lambda / s x mu

S= no servers
Mu = service rate
Lambda = arrival rate 

Represents the fraction of the time we expect the service facility to be busy (i.e., at least one of the servers to be busy).

19
Q

If a continuous random variable has the lack of memory property, what distribution does it have

A

Exponential

20
Q

What’s little’s formula

A

Number of customers in a queue L is equal to arrival rate lambda times the average time in the system

L = λW

21
Q

How to find expected queue length of a s-server system

A

Sum all of the state’s number of consumers i multiplied by the probability shifted up the queue by s (number of servers): p(i + s)

22
Q

For Kendall’s notation what do M, D and G stand for

A

Memoryless (exponential)
Deterministic (not probabilistic)
General (unspecified)