Leung et al (2007) An Overview of Packet Reordering in TCP: Problems, Solutions, and Challenges (Tran. Parallel & Dist Sys)
A survey of different approaches to solve the packet reordering problem related to TCP.
[more]
Lee et al (2002) Improving TCP Performance in Multipath Packet Forwarding Networks (JCN)
This paper deals with TCP over multipath networks. It suggest to modify TCP to enhance its performance over multipath, namely, increase the dupthresh to \(D(1+\lfloor\log_2N\rfloor)\) where \(D\) is the number (=3) of dup ACKs to trigger fast retransmission by default. Furthermore, the receiver delay ACK the packets out-of-order by ACK...
[more]
Zhang et al (2002) RR-TCP: A Reordering-Robust TCP with DSACK (ICSI Tech Report)
An abridged version available under the same title in Proc. ICNP 2003, pp.95-106, Nov 2003.
[more]
Bohacek et al (2006) A New TCP for Persistent Packet Reordering (TON)
This paper proposes TCP-PR, a TCP variant to support persistent packet reordering. Assume a network support multipath routing and packets are routed over different paths without concerning their association with a flow, due to delay differences, reordering occurs.
[more]
Ludwig and Katz (2000) The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions (CCR)
The Eifel Algorithm: Proposes to exploit the TCP timestamp option to detect spurious retransmissions. Because the receiver have to ACK the seqno together with the sender’s timestamp, we can make use of it to differentiate an ACK is for the originally sent segment or the retransmitted segment. Before we do...
[more]