TCP-Friendly SIMD Congestion Control and Its Convergence Behavior
نویسندگان
چکیده
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 probe 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 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 square of the time elapsed since the detection of the last loss event. Thus, SIMD can eÆciently 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.
منابع مشابه
Comparative study of TCP friendly Window based Congestion Control Algorithms
This work presents a thorough study of TCP like window based congestion control. These schemes are basically different from memory less AIMD and binomial schemes. As like this, a small step allows a much broader exploration of friendliness for TCP congestion controls than memory less AIMD and binomial schemes. We propose An Array of window based congestion controls possessing higher smoothness ...
متن کاملAnalysis of TCP-friendly Congestion Control Algorithms
TCP is the dominant transport protocol in the Internet. However, the increase-by-one decrease-to-half strategy used by TCP is not suitable for many multimedia applications. Many TCP-friendly congestion control algorithms have been proposed as an alternative to the TCP to suit the needs of multimedia applications. In this paper, we analyze the short-term behavior of three TCP-friendly congestion...
متن کاملAnalysis on Adjustment-Based TCP-Friendly Congestion Control: Fairness and Stability
In this paper, we focus on understanding the binomial congestion control algorithms, which is proposed in [11] and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global f...
متن کاملModeling the Transient Rate Behavior of Bandwidth Sharing as a Hybrid Control System
This paper uses hybrid control to model a problem of computer network systems, the dynamic behavior of bandwidth sharing among competing TCP traffic. It has been well known in the computer network community that well-behaved (TCP-friendly) congestion control mechanisms are crucial to the robustness of the Internet. Congestion control determines the transmission rate for each flow. Right now, mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001