Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
| Hi-index | 0.01 |
The TCP-style AIMD congestion control principle can't meet the need of the upcoming multimedia applications. They demand smooth adjustment and congestion aware, thus recently many works design TCPfriendly congestion control algorithms. In this paper, we focus on understanding one class of TCP-friendly congestion control algorithms, adjustment-based congestion control, which adjust transmission rate when loss is detected 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 fairness and stability. We prove that such class of congestion control algorithms can achieve (p, k+l+1)- proportional fairness globally no matter the network topology is and how many users there are. We also study their dynamical behaviors through a control theoretical approach. The smoothness of the congestion control will result in a less stable system and slower convergence to the fair bandwidth allocation. The modeling and discussions in this paper are quite general and can be easily applied to equation-based TCP-friendly congestion control scheme, another category of TCP-friendly transport protocols.