Consider a router that is managing three flows, on which packets of constant size arrive at the following wall clock times:

All three flows share the same outbound link, on which the router can transmit one packet per time unit. Assume that there is an infinite amount of buffer space.

(a) Suppose the router implements fair queuing. For each packet, give the wall clock time when it is transmitted by the router.
Arrival time ties are to be resolved in order A, B, C. Note that wall clock time T = 2 is FQ-clock time A_i = 1.5.

(b) Suppose the router implements weighted fair queuing, where flows A and B are given an equal share of the capacity and flow C is given twice the capacity of flow A. For each packet, give the wall clock time when it is transmitted.

Transcribed Image Text:

flow A: 1, 2, 4, 6, 7, 9, 10, flow B: 2, 6, 8, 11, 12, 15, flow C: 1, 2, 3, 5, 6, 7, 8.