Show that as long as r 1 < R w 1 /(∑ w j ), then d max is indeed the maximum delay that any packet in flow 1 will ever experience in the WFQ queue.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.