Suppose that the WFQ scheduling policy is applied to a buffer that supports
Chapter 7, Problem P17(choose chapter or problem)
Suppose that the WFQ scheduling policy is applied to a buffer that supports threeclasses, and suppose the weights are 0.5, 0.25, and 0.25 for the three classes.a. Suppose that each class has a large number of packets in the buffer. In whatsequence might the three classes be served in order to achieve the WFQweights? (For round robin scheduling, a natural sequence is 123123123 . . .).b. Suppose that classes 1 and 2 have a large number of packets in the buffer,and there are no class 3 packets in the buffer. In what sequence might thethree classes be served in to achieve the WFQ weights?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer