TCP's Retransmission Timer and the Minimum RTO

Loukili, Alae; Wijesinha, Alexander L.; Karne, Ramesh K.; Tsetse, Anthony

doi:10.1109/icccn.2012.6289266

Cited by 7 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [12] the most appropriate settings of Jacobson's algorithm were sought to optimize the performance of TCP connections in CCN applications, Amongst the others, the values of α, β, δ, RTOmin parameters were examined to see its impact on TCP performance. In [7] the authors evaluated TCP performance in LAN network (short delays) with various settings of the α and β constants in the presence of varying levels of background traffic generated by conventional systems. In [9] the more rigorous approach was proposed.…”

Section: Basic Performance Metrics For Rto Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

The analytical framework for optimizing TCP retransmission algorithm based on adjustment of its EWMA parameters

Grabowski,

Janowski

2024

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

In this paper we derive mathematical description of TCP (Transmission Control Protocol) retransmission probability based on Jacobson’s smoothing algorithm that belongs to EWMA (Exponentially Weighted Moving Average) category. This description is parametrized on the probability density function (pdf) of RTT (Round Trip Time) samples and α, β – two primary parameters of Jacobson’s algorithm. Although it is not a close form expression, it is formulated as an effective algorithm that let us to explicitly calculate the values of RTO (Retransmission Time Out) probability as a function of α, β and the pdf of RTT samples. We achieve the effectiveness of this approach by applying smart discretization of the state space and replacement of continuous functions with discrete approximate equivalents. In this way, we mitigate the cardinality of discrete distributions we deal with that results in linear (n+m) instead of multiplicative (n⋅m) growth of computational complexity. We provide the evaluation of RTO probability for a wide set of α, β parameter values and differently shaped Normal and Laplace pdfs the RTT samples are taken from. The obtained numerical results let us to draw some conclusions regarding the choice of optimal values of α, β parameters as well as the impact of pdf the RTT samples are taken from.

show abstract

Section: Basic Performance Metrics For Rto Algorithmsmentioning

confidence: 99%

“…or minimum RTO [7] or the impact of TCP parameters like delayed acknowledgements or OS clock granularity by experiments [8]. Fewer works took an analytical approach trying to provide models to capture the dependencies between parameter values and the evaluated performance metrics of TCP [9].…”

Section: Introductionmentioning

confidence: 99%

The analytical framework for optimizing TCP retransmission algorithm based on adjustment of its EWMA parameters

Grabowski,

Janowski

2024

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

show abstract

“…A timeout timer T 0 n,m is set to wait for the ACK after v n,m forwards B 0 . The calculation of T 0 n,m is shown in Equation (22) [42]. RTT denotes round trip time, SRTT denotes the RTT after smoothing, and RTTV denotes the absolute value of SRTT − RTT after smoothing.…”

Section: Scheme Analysismentioning

confidence: 99%

An Improved DTN Scheme for Large-Scale LEO Satellite Networks

Liu

Jiang

et al. 2023

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

A large-scale low Earth orbit (LEO) satellite network has the characteristics of a complex link environment, a large number of satellites, and the limited resources of a single satellite. Applying traditional routing algorithms has disadvantages such as high overhead, high end-to-end latency, and low message delivery rate. This paper proposes an improved delay tolerant (DTN) scheme for large-scale LEO satellite networks (LIDTN) to improve transmission efficiency and reduce the resource overhead and end-to-end latency of large-scale satellite networks. This scheme improves the network performance in three aspects: next hop selection, congestion control mechanism, and acknowledgment mechanism. For the next hop selection, we propose an equivalent distance and priori knowledge-based forwarding strategy (EPFS), which has the advantages of low overhead, loop avoidance, and fast convergence. For congestion control, we put forward an emergency function-based bundle drop algorithm (EBDA). For acknowledging, we propose the virtual acknowledgment algorithm (VAA) by combining the characteristics of many path hops and high link disruption rates in large-scale constellations. Finally, we simulate and verify the LIDTN scheme on the OneWeb constellation. The results show that the LIDTN scheme is suitable for large-scale constellations, the EPFS algorithm can reduce the network overhead during data transmission, EBDA can reduce the bundle drop rate, and VAA can reduce the end-to-end latency. LIDTN provides a new solution for large-scale constellation communication.

show abstract

“…The potential pitfall of choosing a low RTO, however, is that it may trigger retransmission of a packet even though the segment is received and an ACK is on its way. Setting a low value for RTO works better when there is a moderate background traffic [26]. For more technical descriptions and the rules governing the measurement of SRTT, RTTVAR, and RTO refer [30].…”

Section: Related Workmentioning

confidence: 99%

A Deep Learning Approach to Dynamic Passive RTT Prediction Model for TCP

Hagos

Engelstad

Yazid

et al. 2019

2019 IEEE 38th International Performance Computing and Communications Conference (IPCCC)

View full text Add to dashboard Cite

The Round-Trip Time (RTT) is a property of the path between a sender and a receiver communicating with Transmission Control Protocol (TCP) over an IP network and over the public Internet. The end-to-end RTT value influences significantly the dynamics and performance of TCP, which is by far the most used communication protocol. Thus, in communication networks, RTT is an important network performance variable. By measuring the traffic at an intermediate node, a network operator or service provider can estimate the RTT and use the estimation to study and troubleshoot the per-connection characteristics and performance. This paper aims at improving the accuracy and timeliness of the RTT estimation, to help network operators improving their analysis. We propose and evaluate a novel deep learning-based model capable of dynamically predicting at real-time the RTT between the sender and receiver with high accuracy based on passive measurements collected at an intermediate node, taking advantage of the commonly used TCP timestamps. We validate extensively our prediction methodology in a controlled experimental testbed and in a realistic scenario on the Google Cloud platform. We show that our model, which is based on classical deep learning algorithms, gives reasonably effective state-of-the-art performance results across multiple TCP congestion control variants. We also show that the model works well for transfer learning. Even though the RTT prediction model was trained on an emulated network, it performs well also when applied to a realistic scenario setting, as demonstrated in our experimental evaluation.

show abstract

TCP's Retransmission Timer and the Minimum RTO

Cited by 7 publications

References 7 publications

The analytical framework for optimizing TCP retransmission algorithm based on adjustment of its EWMA parameters

The analytical framework for optimizing TCP retransmission algorithm based on adjustment of its EWMA parameters

An Improved DTN Scheme for Large-Scale LEO Satellite Networks

A Deep Learning Approach to Dynamic Passive RTT Prediction Model for TCP

Contact Info

Product

Resources

About