Round robin, weighted fair queuing, and priority queuing Let us compare three re
ID: 3274289 • Letter: R
Question
Explanation / Answer
Round robin scheduling -
At t=0, the scheduler will look for packet in queue A, and since the queue is empty, the scheduler will pick the packet from queue B.
At t=1, the scheduler will look for packet in queue B, and pick the packet from queue B.
Priority queuing -
Queue B has the high priority, so the scheduler will pick from queue B till its empty.
Weighted fair queuing -
Queue A has the priority 1 and Queue B has the priority 3.
So, the bandwidth of queue A is 1/(1+3) = 0.25
The bandwidth of queue B is 3/(1+3) = 0.75
If there is no packet in queue, full bandwidth will be allocated to other queue.
Time (s) Queue A arrived packet size (MB) Queue B arrived packet size (MB) Queue A departed packet size (MB) Queue B departed packet size (MB) Remaining packet in Queue A Remaining packet in Queue B t = 0 3 1 0 2 t = 1 1 1 1 1 t = 2 1 1 1 1 t = 3 2 1 1 2 t = 4 1 0 2 t = 5 4 1 0 5Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.