Exercises 1: "Discrete-Event Simulation": Exercise 1.1
Exercises 1: "Discrete-Event Simulation": Exercise 1.1
Consider a very simple router with a single queue and one outgoing link. The queue length is
assumed to be unlimited.
Exercise 1.2: Suppose that packets arrive with interarrival times 1.9, 1.3, 1.1, 1.0 and that service
times are 1.7, 1.8, 1.5, 0.9.
a) Illustrate how this system can be analysed using discrete-event simulation
artificially reproducing in the table below the sequence of simulator’s actions for
these first four packets. Start with time zero (T=0) with no packets in the system.
b) What is the average load of the server (outgoing link)?
c) What is the average packet waiting time related to all packets and to queued
packets?
d) What is the average queue size?