A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments

Wang Hui, Nobuto Watanabe, Shigeyuki Osada, Tokumi Yokohira, Yukinobu Fukushima

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

Abstract

Although Transmission Control Protocol (TCP) is widely used in the Internet, its performance is poor in networks with long delays. To improve TCP performance in such networks as long-delay satellite environments, the use of a PEP (Performance Enhancing Proxy) has been proposed. The PEP operates on a router that connects a terrestrial link and a satellite link along a TCP connection. When a data packet arrives at the PEP, it forwards the packet to the destination host, transmits the corresponding ACK (premature ACK) to the source host on behalf of the destination host, and stores a copy of the packet in a local buffer (PEP buffer) in case retransmission of the packet is required. As a congestion control method on the PEP, a method that keeps the number of prematurely acknowledged packets in the PEP buffer below a threshold (watermark) value has been proposed, and a watermark value optimization algorithm has been also proposed under the assumption that all connections have the same route. In this paper, we propose a watermark value optimization algorithm under a more realistic assumption that connections have different routes. We define the upper bound of the average throughput of a connection as the maximum average throughput in the case that the connection only exists in network. For a given set of connections, the proposed algorithm tries to attain that the average throughputs of connections with smaller upper bounds are equal to their respective upper bounds, and the number of such connections (maximized-connections) is maximized, and the average throughputs of connections with larger upper bounds are maximized under the condition that they are equal to each other and are larger than or equal to any upper bound of the maximized-connections. Numerical examples show that the proposed algorithm attains such goal.

Original languageEnglish
Title of host publication25th AIAA International Communications Satellite Systems Conference
Publication statusPublished - 2007
Event25th AIAA International Communications Satellite Systems Conference, ICSSC 2010 - Seoul, Korea, Republic of
Duration: Apr 10 2007Apr 13 2007

Other

Other25th AIAA International Communications Satellite Systems Conference, ICSSC 2010
CountryKorea, Republic of
CitySeoul
Period4/10/074/13/07

Fingerprint

Transmission control protocol
Throughput
Satellites
Satellite links
congestion
Routers
Telecommunication links
Internet
protocol
method

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Atmospheric Science
  • Electrical and Electronic Engineering
  • Media Technology

Cite this

Hui, W., Watanabe, N., Osada, S., Yokohira, T., & Fukushima, Y. (2007). A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments. In 25th AIAA International Communications Satellite Systems Conference

A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments. / Hui, Wang; Watanabe, Nobuto; Osada, Shigeyuki; Yokohira, Tokumi; Fukushima, Yukinobu.

25th AIAA International Communications Satellite Systems Conference. 2007.

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

Hui, W, Watanabe, N, Osada, S, Yokohira, T & Fukushima, Y 2007, A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments. in 25th AIAA International Communications Satellite Systems Conference. 25th AIAA International Communications Satellite Systems Conference, ICSSC 2010, Seoul, Korea, Republic of, 4/10/07.
Hui W, Watanabe N, Osada S, Yokohira T, Fukushima Y. A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments. In 25th AIAA International Communications Satellite Systems Conference. 2007
Hui, Wang ; Watanabe, Nobuto ; Osada, Shigeyuki ; Yokohira, Tokumi ; Fukushima, Yukinobu. / A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments. 25th AIAA International Communications Satellite Systems Conference. 2007.
@inproceedings{b6e8861b92664c74b04d4e7d02a428af,
title = "A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments",
abstract = "Although Transmission Control Protocol (TCP) is widely used in the Internet, its performance is poor in networks with long delays. To improve TCP performance in such networks as long-delay satellite environments, the use of a PEP (Performance Enhancing Proxy) has been proposed. The PEP operates on a router that connects a terrestrial link and a satellite link along a TCP connection. When a data packet arrives at the PEP, it forwards the packet to the destination host, transmits the corresponding ACK (premature ACK) to the source host on behalf of the destination host, and stores a copy of the packet in a local buffer (PEP buffer) in case retransmission of the packet is required. As a congestion control method on the PEP, a method that keeps the number of prematurely acknowledged packets in the PEP buffer below a threshold (watermark) value has been proposed, and a watermark value optimization algorithm has been also proposed under the assumption that all connections have the same route. In this paper, we propose a watermark value optimization algorithm under a more realistic assumption that connections have different routes. We define the upper bound of the average throughput of a connection as the maximum average throughput in the case that the connection only exists in network. For a given set of connections, the proposed algorithm tries to attain that the average throughputs of connections with smaller upper bounds are equal to their respective upper bounds, and the number of such connections (maximized-connections) is maximized, and the average throughputs of connections with larger upper bounds are maximized under the condition that they are equal to each other and are larger than or equal to any upper bound of the maximized-connections. Numerical examples show that the proposed algorithm attains such goal.",
author = "Wang Hui and Nobuto Watanabe and Shigeyuki Osada and Tokumi Yokohira and Yukinobu Fukushima",
year = "2007",
language = "English",
isbn = "9781624100079",
booktitle = "25th AIAA International Communications Satellite Systems Conference",

}

TY - GEN

T1 - A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments

AU - Hui, Wang

AU - Watanabe, Nobuto

AU - Osada, Shigeyuki

AU - Yokohira, Tokumi

AU - Fukushima, Yukinobu

PY - 2007

Y1 - 2007

N2 - Although Transmission Control Protocol (TCP) is widely used in the Internet, its performance is poor in networks with long delays. To improve TCP performance in such networks as long-delay satellite environments, the use of a PEP (Performance Enhancing Proxy) has been proposed. The PEP operates on a router that connects a terrestrial link and a satellite link along a TCP connection. When a data packet arrives at the PEP, it forwards the packet to the destination host, transmits the corresponding ACK (premature ACK) to the source host on behalf of the destination host, and stores a copy of the packet in a local buffer (PEP buffer) in case retransmission of the packet is required. As a congestion control method on the PEP, a method that keeps the number of prematurely acknowledged packets in the PEP buffer below a threshold (watermark) value has been proposed, and a watermark value optimization algorithm has been also proposed under the assumption that all connections have the same route. In this paper, we propose a watermark value optimization algorithm under a more realistic assumption that connections have different routes. We define the upper bound of the average throughput of a connection as the maximum average throughput in the case that the connection only exists in network. For a given set of connections, the proposed algorithm tries to attain that the average throughputs of connections with smaller upper bounds are equal to their respective upper bounds, and the number of such connections (maximized-connections) is maximized, and the average throughputs of connections with larger upper bounds are maximized under the condition that they are equal to each other and are larger than or equal to any upper bound of the maximized-connections. Numerical examples show that the proposed algorithm attains such goal.

AB - Although Transmission Control Protocol (TCP) is widely used in the Internet, its performance is poor in networks with long delays. To improve TCP performance in such networks as long-delay satellite environments, the use of a PEP (Performance Enhancing Proxy) has been proposed. The PEP operates on a router that connects a terrestrial link and a satellite link along a TCP connection. When a data packet arrives at the PEP, it forwards the packet to the destination host, transmits the corresponding ACK (premature ACK) to the source host on behalf of the destination host, and stores a copy of the packet in a local buffer (PEP buffer) in case retransmission of the packet is required. As a congestion control method on the PEP, a method that keeps the number of prematurely acknowledged packets in the PEP buffer below a threshold (watermark) value has been proposed, and a watermark value optimization algorithm has been also proposed under the assumption that all connections have the same route. In this paper, we propose a watermark value optimization algorithm under a more realistic assumption that connections have different routes. We define the upper bound of the average throughput of a connection as the maximum average throughput in the case that the connection only exists in network. For a given set of connections, the proposed algorithm tries to attain that the average throughputs of connections with smaller upper bounds are equal to their respective upper bounds, and the number of such connections (maximized-connections) is maximized, and the average throughputs of connections with larger upper bounds are maximized under the condition that they are equal to each other and are larger than or equal to any upper bound of the maximized-connections. Numerical examples show that the proposed algorithm attains such goal.

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

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

M3 - Conference contribution

SN - 9781624100079

BT - 25th AIAA International Communications Satellite Systems Conference

ER -