∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

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]

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

October 15, 2009 paper

Extended paper: Changming Ma and Ka-Cheong Leung, “Improving TCP Robustness under Reordering Network Environment”, in Proc. GLOBECOM 2004 [more]

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

October 14, 2009 paper

Packet reordering is a negative effect to TCP performance because: [more]

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

October 13, 2009 paper

Packets out of order came from rerouting a flow from a slow path to a fast path. And the amount of packets out of order is proportional to the delay differential. [more]

Komattireddy and Vokkarane (2007) Source-Ordering for Improved TCP Performance over Load-Balanced Optical Burst-Switched (OBS) Networks (BROADNETS)

October 13, 2009 paper

In OBS network, all-optical switching is done. It is possible to have multipath in the network but when a TCP flow switched from a path to another, packet out of order may occur and that make TCP (Reno) mistook as loss. The solution proposed in this paper is that, because... [more]