A dynamic delayed acknowledgment mechanism to improve TCP performance for asymmetric links

Afifi, Hossam; Elloumi, Omar; Rubino, Gerardo

doi:10.1109/iscc.1998.702493

Cited by 8 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whereas WAITSW(1) acknowledges when there are W unacknowledged packets, WAITSW_WL(1) acknowledges when there are W l unacknowledged packets. Thus, the sliding window never obstructs S from sending packets in the running of WAITSW_WL(1), which is also the case for WAITSW (1). Hence, it holds that a i = r i for any i.…”

Section: Algorithm Waitsw_wl(1)mentioning

confidence: 88%

“…All of these works are different from our paper in that they do not take the sliding window into account. Experimentally, Afifi et al [1] examined how to change the delay duration in the delayed ACK adaptively in an asymmetric network environment such as ADSL.…”

Section: Related Workmentioning

confidence: 99%

“…On the other hand, the sliding window permits S to send p i only after A acknowledges p i−W if i > W , where W is a constant integer. Let ack A (p) be the time when A acknowledges a packet p. In DTCPSW, by assuming that the propagation delay between S and R equals 0, a A i is described by (1). Here, when…”

Section: Problem Statementmentioning

confidence: 99%

“…1 The window size can be represented as the function such that, if p i is the latest acknowledged packet, the window size becomes w(i) which is a non-decreasing function with respect to i. The TCP sender S can inject up to the packet p i+w(i) .…”

Section: Variable Window Sizementioning

confidence: 99%

See 3 more Smart Citations

Dynamic TCP acknowledgment with sliding window

Koga

2009

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tThe dynamic TCP acknowledgement problem which focuses the acknowledgment mechanism in TCP protocol has been intensively studied in the area of competitive analysis. However, its framework does not consider the sliding window in the TCP protocol that restricts the maximum number of packets that the sender can inject into the network without an acknowledgement. This paper proposes a new problem in which the sliding window is realistically integrated. We study how the ability of on-line algorithms changes, depending on whether the receiver is taught the window size. The greater part of this paper assumes that the window size is a constant integer W . We first show that, if W is given, the optimal on-line algorithm for the previous framework can be extended to our new framework and achieves the optimal competitive ratio of 2. Next we prove that, if W is not given, the lower bound of the competitive ratio for an algorithm class which contains the optimal algorithm for the previous framework depends on the peak packet rate T from the sender and W , and is not better than T W + T W −1 -competitive. Then, we prove that there exists an on-line algorithm that is T W + 2 -competitive, when W is unknown. An optimal off-line algorithm is also presented in this paper. Significantly, our problem models the situation in which an on-line algorithm involuntarily transforms the input and processes the modified input without noticing the transformation.

show abstract

Section: Algorithm Waitsw_wl(1)mentioning

confidence: 88%

Section: Related Workmentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

Section: Variable Window Sizementioning

confidence: 99%

See 2 more Smart Citations

Dynamic TCP acknowledgment with sliding window

Koga

2009

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The performance of Reno's connections on asymmetric networks was studied in [9]. Other researchers [7][8] also proposed several schemes to improve Reno's performance under asymmetry by reducing ack rate on the reverse path.…”

Section: Introductionmentioning

confidence: 99%

Performance degradation of TCP Vegas in asymmetric networks and its remedies

Chung²,

Liew³

ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)

View full text Add to dashboard Cite

-TCP Vegas employs congestion avoidance, early detection of packet loss and conservative slow-start algorithms to improve TCP performance. With its proactive congestion detection, it utilizes network bandwidth more efficiently and achieves a higher throughput than TCP Reno. This paper shows that in asymmetric networks in which the bottleneck is on the reverse path rather than on the forward path, its performance can be significantly lower than that of Reno, in contrast to the 37% throughput improvement claimed in [4][5]. In particular, Vegas may erroneously converge to an operating region in which the available bandwidth on the forward path is under-utilized by a large margin. Even worse, when connections running Vegas and Reno co-exist and compete on the same network, Vegas suffers a severe penalty. We propose an approach to improve Vegas' throughput in asymmetric networks.I.

show abstract

TCP performance analysis and optimization over DMT based ADSL system

He¹,

Che²

2002

Computer Communications

View full text Add to dashboard Cite

A dynamic delayed acknowledgment mechanism to improve TCP performance for asymmetric links

Cited by 8 publications

References 12 publications

Dynamic TCP acknowledgment with sliding window

Dynamic TCP acknowledgment with sliding window

Performance degradation of TCP Vegas in asymmetric networks and its remedies

TCP performance analysis and optimization over DMT based ADSL system

Contact Info

Product

Resources

About