TCP-Ho

A congestion control algorithm with design and performance evaluation

Cheng Yuan Ho, Yi-Cheng Chan, Yaw Chung Chen

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A critical design issue of Transmission Control Protocol (TCP) is its congestion control that allows the protocol to adjust the end-to-end communication rate based on the detection of packet loss. However, TCP congestion control may function poorly during its slow start and congestion avoidance phases. This is because TCP sends bursts of packets with the fast window increase and the ACK-clock based transmission in slow start, and respond slowly with large congestion windows especially in high bandwidth-delay product (BDP) networks during congestion avoidance. In this article, we propose an improved version of TCP, TCP-Ho, that uses an efficient congestion window control algorithm for a TCP source. According to the estimated available bandwidth and measured round-trip times (RTTs), the proposed algorithm adjusts the congestion window size with a rate between exponential growth and linear growth intelligently. Our extensive simulation results show that TCP-Ho significantly improves the performance of connections as well as remaining fair and stable when the BDP increases. Furthermore, it is feasible to implement because only sending part needs to be modified.

Original languageEnglish
Pages (from-to)516-526
Number of pages11
JournalIEICE Transactions on Communications
VolumeE90-B
Issue number3
DOIs
Publication statusPublished - 2007 Jan 1

Fingerprint

Transmission control protocol
Bandwidth
Packet loss
Clocks
Network protocols
Communication

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{ebd6c964df5940c59fdc29be3c67da17,
title = "TCP-Ho: A congestion control algorithm with design and performance evaluation",
abstract = "A critical design issue of Transmission Control Protocol (TCP) is its congestion control that allows the protocol to adjust the end-to-end communication rate based on the detection of packet loss. However, TCP congestion control may function poorly during its slow start and congestion avoidance phases. This is because TCP sends bursts of packets with the fast window increase and the ACK-clock based transmission in slow start, and respond slowly with large congestion windows especially in high bandwidth-delay product (BDP) networks during congestion avoidance. In this article, we propose an improved version of TCP, TCP-Ho, that uses an efficient congestion window control algorithm for a TCP source. According to the estimated available bandwidth and measured round-trip times (RTTs), the proposed algorithm adjusts the congestion window size with a rate between exponential growth and linear growth intelligently. Our extensive simulation results show that TCP-Ho significantly improves the performance of connections as well as remaining fair and stable when the BDP increases. Furthermore, it is feasible to implement because only sending part needs to be modified.",
author = "Ho, {Cheng Yuan} and Yi-Cheng Chan and Chen, {Yaw Chung}",
year = "2007",
month = "1",
day = "1",
doi = "10.1093/ietcom/e90-b.3.516",
language = "English",
volume = "E90-B",
pages = "516--526",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

TCP-Ho : A congestion control algorithm with design and performance evaluation. / Ho, Cheng Yuan; Chan, Yi-Cheng; Chen, Yaw Chung.

In: IEICE Transactions on Communications, Vol. E90-B, No. 3, 01.01.2007, p. 516-526.

Research output: Contribution to journalArticle

TY - JOUR

T1 - TCP-Ho

T2 - A congestion control algorithm with design and performance evaluation

AU - Ho, Cheng Yuan

AU - Chan, Yi-Cheng

AU - Chen, Yaw Chung

PY - 2007/1/1

Y1 - 2007/1/1

N2 - A critical design issue of Transmission Control Protocol (TCP) is its congestion control that allows the protocol to adjust the end-to-end communication rate based on the detection of packet loss. However, TCP congestion control may function poorly during its slow start and congestion avoidance phases. This is because TCP sends bursts of packets with the fast window increase and the ACK-clock based transmission in slow start, and respond slowly with large congestion windows especially in high bandwidth-delay product (BDP) networks during congestion avoidance. In this article, we propose an improved version of TCP, TCP-Ho, that uses an efficient congestion window control algorithm for a TCP source. According to the estimated available bandwidth and measured round-trip times (RTTs), the proposed algorithm adjusts the congestion window size with a rate between exponential growth and linear growth intelligently. Our extensive simulation results show that TCP-Ho significantly improves the performance of connections as well as remaining fair and stable when the BDP increases. Furthermore, it is feasible to implement because only sending part needs to be modified.

AB - A critical design issue of Transmission Control Protocol (TCP) is its congestion control that allows the protocol to adjust the end-to-end communication rate based on the detection of packet loss. However, TCP congestion control may function poorly during its slow start and congestion avoidance phases. This is because TCP sends bursts of packets with the fast window increase and the ACK-clock based transmission in slow start, and respond slowly with large congestion windows especially in high bandwidth-delay product (BDP) networks during congestion avoidance. In this article, we propose an improved version of TCP, TCP-Ho, that uses an efficient congestion window control algorithm for a TCP source. According to the estimated available bandwidth and measured round-trip times (RTTs), the proposed algorithm adjusts the congestion window size with a rate between exponential growth and linear growth intelligently. Our extensive simulation results show that TCP-Ho significantly improves the performance of connections as well as remaining fair and stable when the BDP increases. Furthermore, it is feasible to implement because only sending part needs to be modified.

UR - http://www.scopus.com/inward/record.url?scp=33947118191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947118191&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e90-b.3.516

DO - 10.1093/ietcom/e90-b.3.516

M3 - Article

VL - E90-B

SP - 516

EP - 526

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 3

ER -