A simple queuing model consists of a FIFO queue having infinite capacity followed by a server having capacity two. Entities arrive at the queue with random inter-arrival times; the entities are named by numbering them sequentially by order of arrival. Service times also are random times drawn from some distribution as an entity begins service.

A discrete event simulation run is conducted for this system. The system begins empty and idle at t = 0; the event arrive corresponds to an entity arriving at the queue and the event depart corresponds to an entity departing the server. The following event record is recorded.

Event Number Entity Affected Event Type Event Time

1 1 Arrive 1

2 2 Arrive 2

3 3 Arrive 4

4 4 Arrive 5

5 1 Depart 6

6 5 Arrive 7

7 2 Depart 8

8 6 Arrive 8

9 3 Depart 10

10 7 Arrive 11

11 4 Depart 12

12 8 Arrive 13

13 9 Arrive 14

14 5 Depart 15

15 6 Depart 15

16 -- Terminate 15

Answer the following questions concerning this simulation run.

A. Determine the maximum entity flow time.

B. Determine the average entity flow time.

C. Determine the maximum number of entities in the queue.

D. Determine the average number of entities in the queue.

E. Determine the maximum delay in queue.

F. Determine the average delay in queue.

G. Determine the percent utilization of the server.