A novel hierarchical packet fair scheduling model
Shang Yanlei, Zhao Lifen, Ju Liu, Montse Nájar · 2004
In this paper, a novel hierarchical packet fair scheduling model is proposed based on the J. Bennett and H. Zhang scheduling model. The soft-QoS traffic introduced in this new model together with hard-QoS and best-effort traffic is scheduled by the router. The model can distribute bandwidth reasonably between the QoS and the best-effort traffic. It also guarantees the validity and fairness among the QoS traffic. The performance of the new model is proven by computer simulations.