Abstract
Future high-speed networks will simultaneously support multiple types of services over a single physical infrastructure. Packet scheduling discipline is a crucial technique to enable this. This paper proposes a new weighted fair queuing discipline – Probability based Weighted Fair Queueing, P-WFQ – for high-speed, integrated-service, packet-switched networks. P-WFQ reduces the complexity of implementation by avoiding the main problem of traditional weighted fair queueing algorithm – the calculation of the weight parameter for each packet. It uses a random number to find the next packet to be serviced. In addition, it uses a novel grouping technology, which congregates large number of different flows into a smaller number of groups and reduces the complexity of P-WFQ greatly. This makes it suit for high-speed networks. The simulations prove the validity and practicability of P-WFQ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. Internetworking: Research and Experience 1(1), 3–26 (1990)
Katevenis, M., Sidiropoulos, S., Courcoubetis, C.: Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE J. Select. Areas Commun. 9, 1265–1279 (1991)
Parekb, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ ACM Trans. on Networking, 344–357 (June 1993)
Golestani, S.: A self-clocked fair queueing scheme for broadband applications. In: Proc. IEEE INFOCOM 1994, Toronto, Ont., Canada, pp. 636–646 (April 1994)
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. In: Proc. ACM SIGCOMM 1995, Cambridge, MA, September 1995, pp. 231–242 (1995)
Bennett, R., Zhang, H.: WF2Q: Worst-case fair weighted fair Queueing. In: IEEE INFOCOM 1996, March 1996, pp. 120–128 (1996)
Goyal, P., Vin, H.M., Chen, H.: Start-time fair queueing: A scheduling algorithm for integrated services. In: Proc. ACM-IGCOMM 1996, Palo Alto, CA, pp. 157–168 (1996)
Bennett, J.C.R., Zhang, H.: Hierarchical packet fair Queueing algorithms. IEEE/ ACM Trans. on Networking 5, 675–689 (1997)
Altintas, O., et al.: Urgency-based round robin: A new scheduling discipline for packet switching networks. In: IEEE INFOCOMM 1998, pp. 1183–1197 (1998)
Stephens, D.C., Bennett, J.C.R., Zhang, H.: Implementing scheduling algorithms in high-speed networks. IEEE Journal on Selected Areas in Communications 17(6), 1145–1158 (1999)
Jiang, Y., Tham, C.K., Ko, C.C.: A probabilistic priority scheduling discipline for multi-service networks. In: IEEE ISCC 2001 (July 2001)
Stoica, I., Shenker, S., Zhang, H.: Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks. IEEE/ACM Transactions on Networking 11(1), 33–46 (2003)
Network Simulator - ns-2 (2.28), http://www.isi.edu/nsnam/ns/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, DB., Xie, JY. (2006). Probability Based Weighted Fair Queueing Algorithm with Adaptive Buffer Management for High-Speed Network. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_52
Download citation
DOI: https://doi.org/10.1007/11881223_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45907-1
Online ISBN: 978-3-540-45909-5
eBook Packages: Computer ScienceComputer Science (R0)