WN - 3.03

Question 1

Describe the M/M/1/N queue

Answer 1

1. Poisson arrival process
2. Exponential service times
3. Single server
4. Finite capacity of N customers in the system

Question 2

What is the blocking probability

Answer 2

Only for systems with finite capacity

The probability that an arriving customer will find the system full

Question 3

Describe the M/M/inf

Answer 3

1. Infinite amount of servers
2. Every arriving customer is put into service
3. No queue delay, only service time

Question 4

Describe the M/M/m

Answer 4

1. m servers
2. Any arriving customer (packet) is routed to any server that is available; if none available, the packet enters a single queue

Question 5

Describe the M/M/m/m

Answer 5

1. m-server loss system
2. m servers
3. last ‘m’ -> m customers
4. queueing is not allowed, so a customer that arrives at a system with all servers busy is lot