Preferential bandwidth allocation for short flows with active queue management

Authors:
Heying Zhang;Liu Lu;Liquan Xiao;Wenhua Dou
Affiliations:
School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 7
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
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
A control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
The War Between Mice and Elephants

The War Between Mice and Elephants
Design of a robust active queue management algorithm based on feedback compensation

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding Internet traffic streams: dragonflies and tortoises

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several fair queueing mechanisms based on stateless core (SCORE)/dynamic packet state (DPS) architecture have been proposed to address the scalability problem of stateful architectures. However, most of these mechanisms indiscriminatingly label every packet in edge routers while only a small fraction of the packets that come from fast flows will be dropped by core routers. Moreover, these mechanisms usually apply simple techniques to detect congestion, which makes them unable to control the queue length. In this paper, a new fair bandwidth allocation mechanism is proposed. In the new mechanism, edge routers only label the packets of long flows so that the bandwidth is preferentially allocated to short flows and the remaining is fairly allocated among the competing long flows. Furthermore, routers can keep the queue length at a reference value using active queue management (AQM) algorithm. The simulation results show that this mechanism performs well in many aspects.