Approximation for a two-class weighted fair queueing discipline

This paper presents an approximating model for a 2-class weighted fair queueing (or random polling) model. The approximating system can be analyzed analytically to obtain mean performance measures such as expected delay. We show through a formal argument that the approximation works well when the overall utilization of the system ρρ is small. Based on simulation experiments, we develop a modified version of the approximation that is accurate for a wide range of ρρ. Finally, we extend the approximation to more complex queueing scenarios, such as the low-latency-queueing discipline and systems with more than 2 classes.