WN - 3.01 Flashcards

1
Q

What are considered inputs?

A
  1. Number of users
  2. Arrival characteristics
  3. Service characteristics
  4. Resources
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the performances?

A
  1. Waiting time
  2. Blocking
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Explain what

a/b/m/K is in Kendall’s notation

A

a = type of arrival process

b = service time distribution

m = number of servers

K = maximum number of customers allowed in the system

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

What happens if a is equal to M?

A

M denotes poisson arrival

  1. interarrival times are iid
  2. exponential random variables
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What happens if a is equal to M, D, or G?

A

M = denotes exponentially-distributed

D = constant service times

G = iid service times following some general distribution

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

Explain little’s law

A

Queue is the product of the arrival rate and the average time spend in the system

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