Using TCP Duplicate Selective Acknowledgement (DSACKs) and Stream Control Transmission Protocol (SCTP) Duplicate Transmission Sequence Numbers (TSNs) to Detect Spurious Retransmissions

Blanton, Ethan; Allman, Mark

doi:10.17487/rfc3708

Cited by 39 publications

(33 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DSACK-based algorithm [BA04] uses DSACK information in TCP [FMM + 00] to detect if a retransmission was spurious. A DSACK tells a sender that the receiver has received a packet more than once (if a sender had only sent the packet once, a DSACK implies that duplicates were created in the network).…”

Section: Related Workmentioning

confidence: 99%

“…An SCTP sender will be unable to detect the timeout spurious until duplicate notifications arrive from the receiver. The solution is an optional extension that calls for integrating the DupTSN-based algorithm as defined in [BA04] with the Eifel algorithm to yield a more robust spurious retransmission detection algorithm.…”

Section: A Solution: Extending the Eifel Algorithmmentioning

confidence: 99%

“…The Eifel algorithm [LM03] uses the timestamp option in TCP [JBB92] as an explicit signaling mechanism, and is able to detect spurious fast retransmits as well as spurious timeouts. The DSACK-based algorithm [BA04] uses the DSACK notification [FMM + 00], a signal from the receiver indicating it has received a packet more than once, to detect both spurious fast retransmits and spurious timeouts. Forward RTO (F-RTO) [SKR04] is a heuristic algorithm which changes the retransmission pattern of a sender after a timeout event, and watches the incoming acks to detect spurious timeouts.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On making SCTP robust to spurious retransmissions

Ladha

Baucke

Ludwig

et al. 2004

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

Network anomalies such as packet reordering and delay spikes can result in spurious retransmissions and degrade performance of reliable transport protocols such as TCP and SCTP. Past research showed that in certain networks or paths, such anomalies were fairly common. The result was a series of proposals (Eifel, DSACK-based, F-RTO) targeted towards making a transport robust to such events. Most of the proposals focused on TCP and assumed applicability to SCTP. This paper focuses on SCTP and makes three contributions. First, the effect of spurious retransmissions in SCTP is shown to be more aggravated than in TCP, leading to a problem of congestion window overgrowth. Second, it is shown that most but not all of the solution space is shared between TCP and SCTP. An extension to the Eifel algorithm is proposed. Third, a microscopic as well as macroscopic comparison of the Eifel algorithm and the DSACKbased algorithm is presented. Such a comparison will provide implementers and vendors a clearer view of the applicability and tradeoffs involved in different algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: A Solution: Extending the Eifel Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On making SCTP robust to spurious retransmissions

Ladha

Baucke

Ludwig

et al. 2004

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…But instead of providing information about out-of-order data, it is sent in response to receiving a packet multiple times. This enables detection of a spurious retransmission: if a DSACK is received for a retransmitted packet, then the sender knows that the original transmission and the retransmission have arrived and implicitly the original transmission was not lost, but reordered [16]. Figure 4 shows such a situation.…”

Section: B Duplicate Sackmentioning

confidence: 99%

I'll be a bit late — packet reordering in mobile networks

et al. 2017

View full text Add to dashboard Cite

Data transfer in mobile networks has increased significantly over the past years, and the capacity of these networks has grown accordingly. Due to their different set of characteristics compared to wired networks, they have also received attention from end-to-end developers on transport and application level. However, there exists no research on packet reordering in modern mobile networks, and how a transport layer should be designed to cope with it. In this paper we discuss how to measure packet reordering in mobile networks with the help of TCP. Our analysis in Finnish mobile networks shows that reordering characteristics depend heavily on the operator, but is present in all tested networks, and negatively impacts TCP when not handled. We find that both number of reorderings in a connection and the extent of the reordering is influenced by the sending rate. Additionally, we present the framework for a reordering prevention algorithm which takes into account the findings by automatically adapting to the current sending rate.

show abstract

“…With this extension, called DSACK, the sender is able to infer the order of packets received at the receiver and, therefore, to infer when it has unnecessarily retransmitted a packet. A TCP sender could then use this information to detect spurious retransmissions (see [RFC3708]). …”

Section: Strongly Encouraged Enhancementsmentioning

confidence: 99%