How unfair can weighted fair queuing be?

This paper presents a study carried out on a weighted fair queuing implementation for Unix routers-the WFQ implementation of the ALTQ project. It shows the WFQ/ALTQ weaknesses and explains why we cannot expect an interesting behavior from a system using such a scheduler. The conclusions here presented are supported by a set of tests using UDP traffic only. With a tool developed in our laboratory, we were able to show that changing the classes' weights does not necessarily result on a different quality of service for each of the existing classes. To achieve this differentiation, the lengths of the queues which serve the scheduler (one for each class) must be increased beyond reasonable values. We found that the low-level dynamics of FreeBSD systems practically turns WFQ schedulers useless. The same is applicable to any other work-conserving discipline. Thus, an important conclusion of this paper, is that one must design very carefully the platforms that support work conserving disciplines in order to expect adequate behaviors from those systems, in terms of QoS provision