Fairness among high speed and traditional TCP under different queue management mechanisms

Authors:
Addisu Eshete;Yuming Jiang;Lars Landmark
Affiliations:
Norwegian University of Science and Technology, O. S. Bragstads plass, Trondheim, Norway;Norwegian University of Science and Technology, O. S. Bragstads plass, Trondheim, Norway;Norwegian University of Science and Technology, O. S. Bragstads plass, Trondheim, Norway
Venue:
Proceedings of the Asian Internet Engineeering Conference
Year:
2012

Citing 12
Cited 0

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
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
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Internet research needs better models

ACM SIGCOMM Computer Communication Review
Controlling High-Bandwidth Flows at the Congested Router

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Scalable TCP: improving performance in highspeed wide area networks

ACM SIGCOMM Computer Communication Review
NS-2 TCP-Linux: an NS-2 TCP implementation with congestion control algorithms from Linux

WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
CUBIC: a new TCP-friendly high-speed TCP variant

ACM SIGOPS Operating Systems Review - Research and developments in the Linux kernel
TCP Congestion Avoidance Algorithm Identification

ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Approximate fairness through limited flow list

Proceedings of the 23rd International Teletraffic Congress
Controlling queue delay

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Internet is no longer controlled by a single TCP algorithm. Due to the scalability limitations of traditional TCP algorithms, a plethora of new high-speed TCP congestion control algorithms have been proposed and deployed. Having no standards to follow, these algorithms are ad hoc fixes and some of them have been adopted by various operating system vendors. This begs the question of whether these heterogeneous TCP algorithms are fair or compatible both to each other and to the traditional TCP algorithm. Our simulation study shows that most of the TCP algorithms are surprisingly highly unfair to each other or to the traditional TCP algorithm under several well-known queue management (QM) schemes. This calls for new approaches to QM schemes, and a recently proposed QM scheme, AFpFT, is hence included in the study. Promisingly, AFpFT helps battle the TCP heterogeneity and enforce fairness among the various considered TCP variants. We believe this study sheds new lights on TCP and QM designs.