Responding to spurious timeouts in TCP

Gurtov, Andrei; Ludwig, R.

doi:10.1109/infcom.2003.1209251

Cited by 71 publications

(48 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this work we demonstrate that for such scenarios TCP throughput could be further increased by selecting a larger RTO. Our results are strengthened by simulations in [12], which show that proper handling of spurious timeouts on paths with a high bandwidth-delay product can increase TCP throughput by up to ¢ ¡ ¢ £ ¥ ¤ . Note that for a high bandwidth-delay product the window size and thus the RTO value under our algorithm would be large, which reduces the number of spurious timeouts.…”

Section: Introductionmentioning

confidence: 55%

“…Ludwig and Katz [18] propose the Eifel algorithm to eliminate the unnecessary retransmissions that can result from a spurious retransmission timeout. Gurtov and Ludwig [12] present an enhanced version of the Eifel algorithm and show its performance benefits on paths with a high bandwidth-delay product. Ekstr and Ludwig [8] propose a new algorithm for calculating the RTO, named the Peak-Hopper-RTO (PH-RTO), that improves upon the performance of TCP in high loss environments.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing TCP Retransmission Timeout

Kesselman

Mansour

2005

Networking - ICN 2005

View full text Add to dashboard Cite

Abstract-Delay spikes on Internet paths can cause spurious TCP timeouts leading to significant throughput degradation. However, if TCP is too slow to detect that a retransmission is necessary, it can stay idle for a long time instead of transmitting. The goal is to find a Retransmission Timeout (RTO) value that balances the throughput degradation between both of these cases. In the current TCP implementations, RTO is a function of the Round Trip Time (RTT) alone. We show that the optimal RTO that maximizes the TCP throughput need to depend also on the TCP window size. Intuitively, the larger the TCP window size, the longer the optimal RTO. We derive the optimal RTO for several RTT distributions. An important advantage of our algorithm is that it can be easily implemented based on the existing TCP timeout mechanism.

show abstract

Section: Introductionmentioning

confidence: 55%

Section: Introductionmentioning

confidence: 99%

Optimizing TCP Retransmission Timeout

Kesselman

Mansour

2005

Networking - ICN 2005

View full text Add to dashboard Cite

show abstract

“…Fu et al, [6] in their work propose TCP Eifel for detecting viral timeouts and retransmissions using time stamping. Further usage of Eifel method to enhance TCP has been proposed by Gurtov and Ludwig in [7], in order to avoid spurious timeouts.…”

Section: Related Workmentioning

confidence: 99%

Techniques for Throughput Enhancement in Wireless Networks

Miyim¹

2016

JCTECS

View full text Add to dashboard Cite

Abstract-In wireless systems, unnecessary signal degradation is caused by spurious timeouts from highly variable round-trip times (RTTs) for Transmission Control Protocol (TCP). This paper proposes two methods of improving TCP throughput in wireless networks. Selecting a threshold higher than standard for retransmission timeout (RTO) and use of select-N-repeat (SNR) and trace-N-retransmit (TNR) as retransmission policies upon packet timeout are the two techniques adopted in this study. Simulation reveals that the former method helps reduce timeouts and provides relative throughput gain in a simulated network environment. However in the later method, TNR was found to improve throughput gain by about 8% over the SNR policy when packets at the receiver end arrive out-of-order.

show abstract

“…How to reverse the congestion control state is the problem of responding to spurious timeout. Responding mechanism still remains as research issues [5].…”

Section: Related Workmentioning

confidence: 99%

“…N-filter works as follower, smoother and limiter for different ranges of sample x. Follower, x av new = x, works for fast adaptation to real ACK inter-arrival value, while the limiter, x av new = x av old , excludes unwanted large sample values that exist in the initial phase of slow start period 5 . Smoother, x av new = α N x av old + β N x, works as linear filter for valid sample values.…”

Section: Setting Timer Value Tmentioning

confidence: 99%

Considering spurious timeout in proxy for improving TCP performance in wireless networks

Kim

Cho

2004

Computer Networks

View full text Add to dashboard Cite

Abstract-In this paper, we introduce a new proxy that effectively prevents unnecessary retransmissions from flowing over a wireless link on a path with sudden delay. The proposed STD algorithm detects spurious timeout based on the comparison of the measured inter-arrival timeout of ACK during spurious timeout period with the average inter-arrival time of ACK. It responses to spurious timeout by filtering duplicate ACKs that can cause spurious fast retransmission. Simulation results show that proposed Spurious Timeout Detection (STD) algorithm performs better than, or as well as, other end-to-end mechanisms in the ranges of data rate which current wireless networks can provide.

show abstract

Responding to spurious timeouts in TCP

Cited by 71 publications

References 24 publications

Optimizing TCP Retransmission Timeout

Optimizing TCP Retransmission Timeout

Techniques for Throughput Enhancement in Wireless Networks

Considering spurious timeout in proxy for improving TCP performance in wireless networks

Contact Info

Product

Resources

About