1. TCP-friendliness (Ashvin Goel)
These papers deal with the notion of TCP-friendly flows. Recently several
TCP-friendly congestion control algorithms have been proposed whose long-term
throughput as a function of a steady-state loss rate is similar to that of
TCP. These algorithms are motivated by the needs of some streaming and multicast
applications and their key characteristic is that they are slowly responsive,
refraining from reacting as drastically as TCP to a single packet loss.
The first paper investigates the behavior of slowly-responsive TCP-friendly
congestion control algorithms under realistic dynamic network conditions,
addressing the fundamental question of whether these algorithms are safe
to deploy in the public Internet. The second paper also investigates the
behavior of slowly-responsive TCP-friendly algorithms under dynamic network
conditions. The last paper proposes a TCP-friendly algorithm called equation-based
congestion control. In this mechanism, the sender does not reduce the sending
rate by half in response to a single packet drop but explicitly adjusts the
sending rate as a function of the measured rate of loss events.
Click here for the slide presentation
References
- D. Bansal, H. Balakrishnan, S. Floyd, S. Shenker, "Dynamic
Behavior of Slowly-Responsive Congestion Control Algorithms"
paper
- Y. Yang, M. Kim, S. Lam, "Transient Behaviors of TCP-friendly
Congestion Control Protocols"
paper
- S. Floyd, M. Handley, J. Padhye, J. Widmer, "Equation-Based
Congestion Control for Unicast Applications"
paper