(b) Assume a router uses 4 buffers to store different traffic flows. It receives the packets...

 

Transcribed Image Text:

(b) Assume a router uses 4 buffers to store different traffic flows. It receives the packets listed in Table Q2 at about the same time, in the order listed. All buffers are initially empty, and transmission is not possible until all packets are received. (1) (ii) Packet 1 2 3 4 5 6 7 8 Size Flow 240 1 1 2 240 360 320 200 200 160 160 Table Q2 2 3 3 4 4 Give the order in which packets are transmitted assuming Fair Queuing applied to all buffers. [6 marks] Give the order in which packets are transmitted assuming that buffer 1 is a Priority Queue, and that buffers 2, 3 and 4 are scheduled using Weighted Fair Queuing, with flow 2 having weight 4, flow 3 having weight 2 and flow 4 having weight 1. (b) Assume a router uses 4 buffers to store different traffic flows. It receives the packets listed in Table Q2 at about the same time, in the order listed. All buffers are initially empty, and transmission is not possible until all packets are received. (1) (ii) Packet 1 2 3 4 5 6 7 8 Size Flow 240 1 1 2 240 360 320 200 200 160 160 Table Q2 2 3 3 4 4 Give the order in which packets are transmitted assuming Fair Queuing applied to all buffers. [6 marks] Give the order in which packets are transmitted assuming that buffer 1 is a Priority Queue, and that buffers 2, 3 and 4 are scheduled using Weighted Fair Queuing, with flow 2 having weight 4, flow 3 having weight 2 and flow 4 having weight 1.