∫ntegrabℓε ∂iﬀerentiαℓs

Downey (2007) TCP Self-Clocking and Bandwidth Sharing (ComNet)

October 19, 2009 paper

This paper describes the case when the congestion window of a TCP is greater than the BDP. The BDP is defined as the bottleneck bandwidth multiplies by the end-to-end propagation delay. It finds that, in such scenario, the TCP is undergoing self-clocking transfer which means the cwnd does not play... [more]

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]

Downey (2007) TCP Self-Clocking and Bandwidth Sharing (ComNet)

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

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

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

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