An Approximate Analysis of Two Class WFQ Systems

The class based weighted fair queueing (WFQ) is applied in a lot of computer and communication systems. It is a popular way to share a common resource. Its e#cient analytical solution is an open question for a long time. Different solutions were proposed, using complex analysis or numerical techniques. But all of these methods have their limits in usability. In this paper we present a very simple approach that provides a fast approximation for the queue length and waiting time measures. Although it is simple and looks rough, the comparison with simulation shows that it provides reasonable accuracy with an execution time less than a second