A queue management algorithm for fair bandwidth allocation

Authors:
Tetsuji Yamaguchi;Yutaka Takahashi
Affiliations:
Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida-hommachi, Sakyo-ku, Kyoto 606-8501, Japan;Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida-hommachi, Sakyo-ku, Kyoto 606-8501, Japan
Venue:
Computer Communications
Year:
2007

Citing 13
Cited 1

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Hierarchical packet fair queueing algorithms

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing algorithms for packet-switched networks

IEEE/ACM Transactions on Networking (TON)
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
Maximum and asymptotic UDP throughput under CHOKe

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Controlling High-Bandwidth Flows at the Congested Router

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
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
An active queue management scheme based on a capture-recapture model

IEEE Journal on Selected Areas in Communications

FQL-RED: an adaptive scalable schema for active queue management

International Journal of Network Management

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, a stateless active queue management algorithm called ''PUNSI'' which aims to achieve fair bandwidth allocation in congested routers is proposed. This algorithm prevents unresponsive flows from dominating available bandwidth shared with responsive flows by penalizing packets from unresponsive flows with a higher probability than those from responsive flows. It is motivated by the observation that unresponsive flows tend to generate traffic of higher rates than responsive ones and that, when a packet is dropped due to buffer overflow, fellow packets from the same flow seem to be found in the buffer among those having joined recently. Simulation experiments show that the algorithm discards packets from unresponsive flows effectively and achieves pretty good fair share among flows with low implementation complexity.