TCP-friendly congestion control for highspeed network

Tomoya Hatano, Hiroshi Shigeno, Ken Ichi Okada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


The currently used TCP congestion control, TCP Reno, has two weaknesses. 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. Secondly, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many researches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. This paper proposes a new TCP congestion control algorithm, which is based on the generalized Additive Increase Multiplicative Decrease (AIMD) rules. Our algorithm (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 our proposal by computer simulations and compare it with existing TCP.

Original languageEnglish
Title of host publication2007 International Symposium on Applications and the Internet, SAINT
Publication statusPublished - 2007 Dec 1
Event2007 International Symposium on Applications and the Internet, SAINT - Hiroshima, Japan
Duration: 2007 Jan 152007 Jan 19

Publication series

NameSAINT - 2007 International Symposium on Applications and the Internet


Other2007 International Symposium on Applications and the Internet, SAINT

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software


Dive into the research topics of 'TCP-friendly congestion control for highspeed network'. Together they form a unique fingerprint.

Cite this