Probability based weighted fair queueing algorithm with adaptive buffer management for high-speed network

Authors:
De-Bin Yin;Jian-Ying Xie
Affiliations:
Department of Automation, Shanghai Jiao Tong University, Shanghai, China;Department of Automation, Shanghai Jiao Tong University, Shanghai, China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 7
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Implementing scheduling algorithms in high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.