∫ntegrabℓε ∂iﬀerentiαℓs

Bohacek et al (2006) A New TCP for Persistent Packet Reordering (TON)

October 15, 2009 paper

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)

October 15, 2009 paper

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]

Bohacek et al (2006) A New TCP for Persistent Packet Reordering (TON)

Ludwig and Katz (2000) The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions (CCR)

Ma and Leung (2004) Improving TCP Reordering Robustness in Multipath Networks (LCN)

Blanton and Allman (2002) On Making TCP More Robust to Packet Reordering (CCR)

Kandula et al (2007) Dynamic Load Balancing without Packet Reordering (CCR)