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

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)2344-2357
Number of pages14
JournalIEICE Transactions on Communications
VolumeE95-B
Issue number7
DOIs
Publication statusPublished - Jul 2012

Fingerprint

Throughput
Routers
Bandwidth

Keywords

  • Fairness
  • PEP
  • Performance enhance proxy
  • TCP
  • Throughput
  • Watermark

ASJC Scopus subject areas

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

Cite this

Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy. / Wang, Hui; Nishida, Yuichi; Fukushima, Yukinobu; Yokohira, Tokumi; Wu, Zhen.

In: IEICE Transactions on Communications, Vol. E95-B, No. 7, 07.2012, p. 2344-2357.

Research output: Contribution to journalArticle

@article{923cfd639ef64531b818986d7924416a,
title = "Throughput Improvement for TCP with a Performance Enhancing Proxy Using a UDP-Like Packet Sending Policy",
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 = "Fairness, PEP, Performance enhance proxy, TCP, Throughput, Watermark",
author = "Hui Wang and Yuichi Nishida and Yukinobu Fukushima and Tokumi Yokohira and Zhen Wu",
year = "2012",
month = "7",
doi = "10.1587/transcom.E95.B.2344",
language = "English",
volume = "E95-B",
pages = "2344--2357",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

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

AU - Wang, Hui

AU - Nishida, Yuichi

AU - Fukushima, Yukinobu

AU - Yokohira, Tokumi

AU - Wu, Zhen

PY - 2012/7

Y1 - 2012/7

N2 - 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.

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.

KW - Fairness

KW - PEP

KW - Performance enhance proxy

KW - TCP

KW - Throughput

KW - Watermark

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

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

U2 - 10.1587/transcom.E95.B.2344

DO - 10.1587/transcom.E95.B.2344

M3 - Article

AN - SCOPUS:84863431074

VL - E95-B

SP - 2344

EP - 2357

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 7

ER -