Consider a router that is managing three flows, on which packets of constant size arrive at the

Question:

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

image text in transcribed

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 Ai = 1.333.

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

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Computer Networks A Systems Approach

ISBN: 9780128182000

6th Edition

Authors: Larry L. Peterson, Bruce S. Davie

Question Posted: