For the purposes of this problem, you can consider the idealized Generalized Pro
ID: 654107 • Letter: F
Question
For the purposes of this problem, you can consider the idealized Generalized Processor Sharing (GPS) as being equivalent to Weighted Fair Queuing (WFQ)
Consider a system of four queues being serviced according to a WFQ scheduling policy as shown in the figure above. The weights given to the four queues (A, B, C, D) are 4, 1, 3, and 2, respectively. They are being serviced by a processor at a rate of 10 Megabits/sec. The table below gives a list of different input traffic rates (in Megabits/sec) at the four input queues. Fill in the resultant output rates for each of these four queues. We have filled in the first two rows to get you started.
Explanation / Answer
INPUT output = (input * weight ) / process rate
A B C D A B C D
1 1 1 1 1 1 1 1
10 10 10 10 4 1 3 2
6 6 2 2 2.4 0.6 0.6 0.4
8 0 0 5 3.2 0 0 1
1 5 3 5 0.4 0.5 0.9 1