Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy

Hui WANG; Yuichi NISHIDA; Yukinobu FUKUSHIMA; Tokumi YOKOHIRA; Zhen WU

doi:10.1587/transcom.E95.B.2344

Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy

Hui WANG, Yuichi NISHIDA, Yukinobu FUKUSHIMA, Tokumi YOKOHIRA, Zhen WU

Full Text Views

0

Share
Cite this

Summary :

To improve TCP throughput even if the maximum receiving window size is small, a TCP performance enhancing proxy (PEP) using a UDP-like packet sending policy with error control has been proposed. The PEP operates on a router along a TCP connection. When the PEP receives a data packet from the source host, it transmits the packet to the destination host, copies the packet into the local buffer (PEP buffer) in case the packets need to be transmitted and sends a premature ACK acknowledging receipt of the packet to the source host. In the PEP, the number of prematurely acknowledged packets in the PEP buffer is limited to a fixed threshold (watermark) value to avoid network congestion. Although the watermark value should be adjusted to changes in the network conditions, watermark adjusting algorithms have not been investigated. In this paper, we propose a watermark adjusting algorithm the goal of which is to maximize the throughput of each connection as much as possible without excessively suppressing the throughputs of the other connections. In our proposed algorithm, a newly established connection uses the initial watermark value of zero to avoid drastic network congestion and increases the value as long as its throughput increases. In addition, when a new connection is established, every already-established connection halves its watermark value to allow the newly established connection to use some portion of the bandwidth and increases again as long as its throughput increases. We compare the proposed algorithm (CW method) with other methods: the FW method that uses a fixed large watermark value and the NP method that does not use the PEP. Numerical results with respect to throughput and fairness showed that the CW method is generally superior to the other two methods.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.7 pp.2344-2357

Publication Date: 2012/07/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.2344

Type of Manuscript: PAPER

Category: Internet

Cite this

Copy

Hui WANG, Yuichi NISHIDA, Yukinobu FUKUSHIMA, Tokumi YOKOHIRA, Zhen WU, "Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 7, pp. 2344-2357, July 2012, doi: 10.1587/transcom.E95.B.2344.
Abstract: To improve TCP throughput even if the maximum receiving window size is small, a TCP performance enhancing proxy (PEP) using a UDP-like packet sending policy with error control has been proposed. The PEP operates on a router along a TCP connection. When the PEP receives a data packet from the source host, it transmits the packet to the destination host, copies the packet into the local buffer (PEP buffer) in case the packets need to be transmitted and sends a premature ACK acknowledging receipt of the packet to the source host. In the PEP, the number of prematurely acknowledged packets in the PEP buffer is limited to a fixed threshold (watermark) value to avoid network congestion. Although the watermark value should be adjusted to changes in the network conditions, watermark adjusting algorithms have not been investigated. In this paper, we propose a watermark adjusting algorithm the goal of which is to maximize the throughput of each connection as much as possible without excessively suppressing the throughputs of the other connections. In our proposed algorithm, a newly established connection uses the initial watermark value of zero to avoid drastic network congestion and increases the value as long as its throughput increases. In addition, when a new connection is established, every already-established connection halves its watermark value to allow the newly established connection to use some portion of the bandwidth and increases again as long as its throughput increases. We compare the proposed algorithm (CW method) with other methods: the FW method that uses a fixed large watermark value and the NP method that does not use the PEP. Numerical results with respect to throughput and fairness showed that the CW method is generally superior to the other two methods.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2344/_p

Copy

@ARTICLE{e95-b_7_2344,
author={Hui WANG, Yuichi NISHIDA, Yukinobu FUKUSHIMA, Tokumi YOKOHIRA, Zhen WU, },
journal={IEICE TRANSACTIONS on Communications},
title={Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy},
year={2012},
volume={E95-B},
number={7},
pages={2344-2357},
abstract={To improve TCP throughput even if the maximum receiving window size is small, a TCP performance enhancing proxy (PEP) using a UDP-like packet sending policy with error control has been proposed. The PEP operates on a router along a TCP connection. When the PEP receives a data packet from the source host, it transmits the packet to the destination host, copies the packet into the local buffer (PEP buffer) in case the packets need to be transmitted and sends a premature ACK acknowledging receipt of the packet to the source host. In the PEP, the number of prematurely acknowledged packets in the PEP buffer is limited to a fixed threshold (watermark) value to avoid network congestion. Although the watermark value should be adjusted to changes in the network conditions, watermark adjusting algorithms have not been investigated. In this paper, we propose a watermark adjusting algorithm the goal of which is to maximize the throughput of each connection as much as possible without excessively suppressing the throughputs of the other connections. In our proposed algorithm, a newly established connection uses the initial watermark value of zero to avoid drastic network congestion and increases the value as long as its throughput increases. In addition, when a new connection is established, every already-established connection halves its watermark value to allow the newly established connection to use some portion of the bandwidth and increases again as long as its throughput increases. We compare the proposed algorithm (CW method) with other methods: the FW method that uses a fixed large watermark value and the NP method that does not use the PEP. Numerical results with respect to throughput and fairness showed that the CW method is generally superior to the other two methods.},
keywords={},
doi={10.1587/transcom.E95.B.2344},
ISSN={1745-1345},
month={July},}

Copy

TY - JOUR
TI - Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy
T2 - IEICE TRANSACTIONS on Communications
SP - 2344
EP - 2357
AU - Hui WANG
AU - Yuichi NISHIDA
AU - Yukinobu FUKUSHIMA
AU - Tokumi YOKOHIRA
AU - Zhen WU
PY - 2012
DO - 10.1587/transcom.E95.B.2344
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2012
AB - To improve TCP throughput even if the maximum receiving window size is small, a TCP performance enhancing proxy (PEP) using a UDP-like packet sending policy with error control has been proposed. The PEP operates on a router along a TCP connection. When the PEP receives a data packet from the source host, it transmits the packet to the destination host, copies the packet into the local buffer (PEP buffer) in case the packets need to be transmitted and sends a premature ACK acknowledging receipt of the packet to the source host. In the PEP, the number of prematurely acknowledged packets in the PEP buffer is limited to a fixed threshold (watermark) value to avoid network congestion. Although the watermark value should be adjusted to changes in the network conditions, watermark adjusting algorithms have not been investigated. In this paper, we propose a watermark adjusting algorithm the goal of which is to maximize the throughput of each connection as much as possible without excessively suppressing the throughputs of the other connections. In our proposed algorithm, a newly established connection uses the initial watermark value of zero to avoid drastic network congestion and increases the value as long as its throughput increases. In addition, when a new connection is established, every already-established connection halves its watermark value to allow the newly established connection to use some portion of the bandwidth and increases again as long as its throughput increases. We compare the proposed algorithm (CW method) with other methods: the FW method that uses a fixed large watermark value and the NP method that does not use the PEP. Numerical results with respect to throughput and fairness showed that the CW method is generally superior to the other two methods.
ER -