Experimental evaluations of gentle highspeed TCP for long-fat networks

Zongsheng Zhang, Go Hasegawa, Masayuki Murata

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

2 Citations (Scopus)

Abstract

It is well-known that TCP Reno cannot provide satisfactory performance in high-speed long-delay networks. As a means addressing this problem, gentle Highspeed TCP (gHSTCP) has been proposed in [1]. However, its effectiveness has only been demonstrated in simulation experiments. In the present paper, a refined gHSTCP algorithm is proposed for application to real networks. The performance of the refined gHSTCP algorithm is then assessed experimentally. The refined gHSTCP algorithm is based on the original algorithm, which uses two modes (Reno mode and HSTCP mode) in the congestion avoidance phase and switches modes based on RTT increasing trends. The refined gHSTCP algorithm compares two RTT thresholds and judges which mode will be used. The experimental results demonstrate that gHSTCP can provide a better tradeoff in terms of utilization and fairness against co-existing traditional TCP Reno connections.

Original languageEnglish
Title of host publication6th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2005 - Proceedings
Pages47-52
Number of pages6
Publication statusPublished - 2005 Dec 1
Externally publishedYes
Event6th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2005 - Yangon, Myanmar
Duration: 2005 Nov 92005 Nov 10

Publication series

Name6th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2005 - Proceedings
Volume2005

Other

Other6th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2005
CountryMyanmar
CityYangon
Period05/11/905/11/10

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Experimental evaluations of gentle highspeed TCP for long-fat networks'. Together they form a unique fingerprint.

Cite this