Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms

Deepak Bansal, Hari Balakrishnan, Sally Floyd, Scott Shenker
ACM SIGCOMM 2001, San Diego, CA, September 2001

The recently developed notion of {\em TCP-compatibility} has led to a number of proposals for alternative congestion control algorithms whose long-term throughput as a function of a steady-state loss rate is similar to that of TCP. Motivated by the needs of some streaming and multicast applications, these algorithms seem poised to take the current TCP-dominated Internet to an Internet where many congestion control algorithms co-exist. An important characteristic of these alternative algorithms is that they are {\em slowly-responsive}, refraining from reacting as drastically as TCP to a single packet loss.

However, the TCP-compatibility criteria explored so far in the literature considers only the static condition of a fixed loss rate. This paper investigates the behavior of slowly-responsive, TCP-compatible congestion control algorithms under more realistic dynamic network conditions, addressing the fundamental question of whether these algorithms are safe to deploy in the public Internet. We study persistent loss rates, long- and short-term fairness properties, bottleneck link utilization, and smoothness of transmission rates.

Simulation Script

[PDF (206KB)] [PostScript (776KB)] [Gzipped PostScript (105KB)]

Bibtex Entry:

@inproceedings{bansal2001dynamic,
   author =       "Deepak Bansal and Hari Balakrishnan and Sally Floyd and Scott Shenker",
   title =        "{Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms}",
   booktitle =    {ACM SIGCOMM 2001},
   year =         {2001},
   month =        {September},
   address =      {San Diego, CA}
}