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).
Chapter PDF
Similar content being viewed by others
References
Parekh, A. A generalized processor sharing approach to flow control-the single node case. In: Proceedings of the IEEE INFOCOM’92, 1992.
Lin, D. Dynamics of random early detection. In: Proceedings of ACM SIGCOMM’ 97, Cannes, France, October 1997, 127–137
Stoica, I. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high-speed networks. In: Proceeding of ACM SIGCOMM’98, 1998, 118–130
Cao, Z. Rainbow fair queueing: Fair bandwidth sharing without per-flow state. In: Proceedings of IEEE Infocom’ 2000, March 2000
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
Zhai, M., Gu, G., Yuan, Y. (2001). Queue Length Based Fair Queueing in Core-Stateless Networks. In: Al-Shaer, E.S., Pacifici, G. (eds) Management of Multimedia on the Internet. MMNS 2001. Lecture Notes in Computer Science, vol 2216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45508-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-45508-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42786-5
Online ISBN: 978-3-540-45508-0
eBook Packages: Springer Book Archive