Queue Length Based Fair Queueing in Core-Stateless Networks^*

Mingyu Zhai, Guanqun Gu, and Yuan Yuan

Department of Computer Science and Engineering,
Southeast University,
Nanjing 210096, China
The Key Laboratory for Computer Networks and Information Integration,
Ministry of Education, China
{myzhai,ggq,yyuan}@seu.edu.cn

Abstract. In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ.

^*This work is supported by Chinese NSF (item number: 69896240)

LNCS 2216, p. 193 ff.

Full article in PDF (35 KB)

Online publication: October 10, 2001
helpdesk@link.springer.de
© Springer-Verlag Berlin Heidelberg 2001