裙休肆.PDFVIP

TCP-friendly SIMD Congestion Control and Its Convergence Behavior Shudong Jin Liang Guo Ibrahim Matta Azer Bestavr os Computer Science Department Boston University Boston, MA 02215 fjins, guol, matta, b est g@ Technical Rep ort BU-CS-2001-006 May 8, 2001 Abstract The increased diversity of Internet application requirements has spurred recent interests in exible congestion control mechanisms. Window-based congestion control schemes use increase rules to prob e available bandwidth, and decrease rules to back o when congestion is detected. The parameterization of these control rules is done so as to ensure that the resulting proto col is TCP-friendly in terms of the relationship b etween throughput and packet loss rate. In this pap er, we prop ose 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 prop ortion to the square of the time elapsed since the detection of the last loss event. Thus, SIMD can eÆciently prob e available bandwidth. Nevertheless, SIMD is TCP-friendly as well as TCP-compatible under RED, and it has much b etter convergence b ehavior than TCP-friendly AIMD and binomial algorithms prop osed recently. Keywords: Congestion Control, TCP-friendly, Fairness, Convergence. 1 Intro d