Title: TCP-friendly SIMD Congestion Control and Its Convergence Behavior

Authors: Shudong Jin, Liang Guo, Ibrahim Matta, and Azer Bestavros

Date: May 8, 2001

Abstract: 

The increased diversity of Internet application requirements has
spurred recent interest in flexible congestion control
mechanisms. Window-based congestion control schemes use increase rules
to probe available bandwidth, and decrease rules to back off when
congestion is detected. The parameterization of these control rules is
done so as to ensure that the resulting protocol is TCP-friendly in
terms of the relationship between throughput and packet loss rate.  In
this paper, we propose a novel window-based congestion control
algorithm called SIMD (Square-Increase/Multiplicative-Decrease).
Contrary to previous memory-less controls, SIMD utilizes history
information in its control rules. It uses multiplicative decrease but
the increase in window size is in proportion to the {\em square} of
the time elapsed since the detection of the last loss event. Thus,
SIMD can efficiently probe available bandwidth. Nevertheless, SIMD is
TCP-friendly as well as TCP-compatible under RED, and it has much
better convergence behavior than TCP-friendly AIMD and binomial
algorithms proposed recently.