3. Suppose a router has three input flows and one output. It receives the packets listed...

Transcribed Image Text:

3. Suppose a router has three input flows and one output. It receives the packets listed in the table below all at about the same time in the order listed during a period in which the output port is busy but all queues are otherwise empty. Give the order in which packets are transmitted (or Fi), assuming Fair Queuing (bit-by-bit round-robin). You may assume that all packets arrive at time=0. Packet 1 2 3 4 5 6 IN 7 8 Size 100 100 100 100 190 200 110 60 Flow 1 1 1 1 2 2 3 3 3. Suppose a router has three input flows and one output. It receives the packets listed in the table below all at about the same time in the order listed during a period in which the output port is busy but all queues are otherwise empty. Give the order in which packets are transmitted (or Fi), assuming Fair Queuing (bit-by-bit round-robin). You may assume that all packets arrive at time=0. Packet 1 2 3 4 5 6 IN 7 8 Size 100 100 100 100 190 200 110 60 Flow 1 1 1 1 2 2 3 3

Answer rating: 100% (QA)

By serving packets in a roundrobin method one bit at a time fair queuing also known as bitbybit roundrobin makes sure that each flow receives a fair a... View the full answer