SRF TCP: a TCP-friendly and fair congestion control method for high-speed networks

Authors:
Masahiko Fukuhara;Fumiaki Hirose;Tomoya Hatano;Hiroshi Shigeno;Ken-ichi Okada
Affiliations:
Faculty of Science and Technology, Keio University, Yokohama, Kanagawa, Japan;Faculty of Science and Technology, Keio University, Yokohama, Kanagawa, Japan;NTT Access Network Service Systems Laboratories, Chiba, Japan;Faculty of Science and Technology, Keio University, Yokohama, Kanagawa, Japan;Faculty of Science and Technology, Keio University, Yokohama, Kanagawa, Japan
Venue:
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Year:
2004

Citing 6
Cited 1

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
Modeling TCP throughput: a simple model and its empirical validation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Equation-based congestion control for unicast applications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Tuning RED for Web traffic

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Congestion control for high bandwidth-delay product networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
General AIMD congestion control

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols

Generalized stochastic performance models for loss-based congestion control

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

TCP Reno congestion control carries two issues. First, its performance is poor in high-speed networks. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Second, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many approaches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. In this paper, we propose Square Root Fair TCP (SRF TCP). SRF TCP congestion control (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of SRF TCP through computer simulations and compare it with TCP Reno, HighSpeed TCP and Scalable TCP.