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

Bansel et al (2001) Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms (SIGCOMM)

October 16, 2009 paper

This paper evaluates different flow control algorithms and it is the first to propose the term “TCP-Friendliness” or “TCP-Compatible”. The motivation is that, a lot of algorithms are proposed to date to avoid the TCP’s AIMD, which changes the rate too drastic and thus not suitable for media streaming use.... [more]

Laor and Gendel (2002) The Effect of Packet Reordering in a Backbone Link on Application Throughput (IEEE Network)

October 16, 2009 paper

A paper in the early year to investigate the effect of packet reordering to application throughput (esp. TCP). The conclusion is trivial but it gives some numbers: [more]

Sathiaseelan and Radzik (2004) Improving the Performance of TCP in the Case of Packet Reordering (HSNMC)

October 16, 2009 paper

This paper proposed the RN-TCP, for Reorder Notifying. [more]

Bhandarkar and Reddy (2004) TCP-DCR: Making TCP Robust to Non-Congestion Events (IFIP Networking)

October 16, 2009 paper

Initiated by the scenario of end-to-end connection involving wireless link, this paper proposes TCP-DCR, the delayed congestion response. [more]

Leung et al (2007) An Overview of Packet Reordering in TCP: Problems, Solutions, and Challenges (Tran. Parallel & Dist Sys)

October 16, 2009 paper

A survey of different approaches to solve the packet reordering problem related to TCP. [more]