Effect of Delays on TCP Performance

Gurtov, Andrei

doi:10.1007/0-306-47001-2_6

Cited by 59 publications

(38 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, [6] shows that long sudden delays, mostly attributed to handovers, are common in the GPRS wireless WAN. It explores the influence of these delays on TCP performance and concludes that the spurious timeouts they trigger may lead to unnecessary retransmissions.…”

Section: Related Workmentioning

confidence: 99%

To drop or not to drop: On the impact of handovers on TCP performance

Cohen

Levin

2008

IEEE INFOCOM 2008 - IEEE Conference on Computer Communications Workshops

View full text Add to dashboard Cite

Abstract-This paper presents a comparison between two handover schemes: drop and forward. In the drop scheme, packets received by the base station after the host has disconnected are dropped, whereas in the forward scheme these packets are forwarded to the new base station. We analyze various TCP flavors and compare our findings to simulation results. Our results can be used to determine which handover scheme and which TCP flavor should be employed to minimize the negative effect of handovers on TCP performance.

show abstract

Section: Related Workmentioning

confidence: 99%

To drop or not to drop: On the impact of handovers on TCP performance

Cohen

Levin

2008

IEEE INFOCOM 2008 - IEEE Conference on Computer Communications Workshops

View full text Add to dashboard Cite

show abstract

“…That assumption works very well in wired networks where most FRRs or RTOs are triggered by the packets lost due to congestion, but it is not appropriate in wireless networks where most FRRs/RTOs are triggered by other reasons such as sudden delay [5][6][7], wireless errors, and mobility. The congestion irrelative FRRs/RTOs *Correspondence: shchung@pusan.ac.kr 2 Department of Computer Engineering, Pusan National University, Busan, South Korea Full list of author information is available at the end of the article incur TCP's misbehaviors such as (1) blindly halving the transmission rate even when the available bandwidth is sufficient, (2) unnecessarily retransmitting the outstanding packets which may be in the bottleneck queue, and (3) needlessly increasing the back-off value exponentially.…”

Section: Introductionmentioning

confidence: 99%

TCP’s dynamic adjustment of transmission rate to packet losses in wirelessnetworks

Park

Chung

Ahn

2012

J Wireless Com Network

View full text Add to dashboard Cite

Based on the assumption of transmission control protocol (TCP) that packets are lost due to congestion, TCP's congestion control algorithms such as fast retransmit/recovery (FRR) and retransmission timeouts (RTO) unconditionally reduce the transmission rate for every packet loss. When TCP operates in wireless networks, however, FRRs/RTOs are often triggered regardless of congestion due to sudden delay and wireless transmission errors. The congestion irrelative FRRs/RTOs incur TCP's misbehavior such as blindly halving the transmission rate, unnecessarily retransmitting the outstanding packets which may be in the bottleneck queue. Although many previous studies have been proposed to detect the congestion irrelative FRRs/RTOs, they paid little attention on effectively adjusting the transmission rate for the detected congestion irrelative FRRs/RTOs. In this article, we propose an enhanced TCP to dynamically adjust its transmission rate according to network conditions. Our scheme adjusts the transmission rate in proportion to the available bandwidth in order to quickly utilize the available bandwidth, and also re-adjusts it in inverse proportion to the loss rate in order to avoid burst losses and long go-back-N retransmissions. By doing so, our scheme has significant effects to avoid the performance degradation caused by the congestion irrelative FRRs/RTOs. Throughout the extensive experiments, we evaluate our scheme and compare it with previous works in terms of goodput, fairness, and friendless under various network topologies. The results show that our scheme significantly outperforms previous studies while it maintains the fair and friendly behavior to other TCP connections.

show abstract

“…This can be caused by packet reordering, packet duplication, or a sudden delay increase in the data or the ACK path that results in a spurious timeout. For example, such sudden delay increases can often occur in wide-area wireless access networks due to handovers, resource preemption due to higher priority traffic (e.g., voice), or because the mobile transmitter traverses through a radio coverage hole (e.g., see [Gu01]). In such wireless networks, the often unnecessary go-back-N retransmits that typically occur after a spurious timeout create a serious problem.…”

Section: Introductionmentioning

confidence: 99%

The Eifel Detection Algorithm for TCP

Ludwig¹,

Meyer²

2003

View full text Add to dashboard Cite

The Eifel detection algorithm allows a TCP sender to detect a posteriori whether it has entered loss recovery unnecessarily. It requires that the TCP Timestamps option defined in RFC 1323 be enabled for a connection. The Eifel detection algorithm makes use of the fact that the TCP Timestamps option eliminates the retransmission ambiguity in TCP. Based on the timestamp of the first acceptable ACK that arrives during loss recovery, it decides whether loss recovery was entered unnecessarily. The Eifel detection algorithm provides a basis for future TCP enhancements. This includes response algorithms to back out of loss recovery by restoring a TCP sender's congestion control state. Terminology

show abstract

Effect of Delays on TCP Performance

Cited by 59 publications

References 22 publications

To drop or not to drop: On the impact of handovers on TCP performance

To drop or not to drop: On the impact of handovers on TCP performance

TCP’s dynamic adjustment of transmission rate to packet losses in wirelessnetworks

The Eifel Detection Algorithm for TCP

Contact Info

Product

Resources

About