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)
The Direct Adjustment Algorithm: A TCP-Friendly Adaptation Scheme
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
| Hi-index | 0.00 |
In this paper, we focus on understanding the binomialcongestion control algorithms, which is proposed in [11]and can generalize TCP-style additive-increase byincreasing inversely proportional to a power k of thecurrent window (for TCP, k=0) and generalize TCP-stylemultiplicative-decrease by decreasing proportional to apower l of the current window (for TCP, l=1).We discusstheir global fairness and stability.We prove that suchcongestion control algorithms can achieve (p, k+l+1)-proportionalfairness globally no matter what thenetwork topology is and how many users there are.Wealso study their dynamical behavior through a controltheoretical approach.The smoothness of the congestioncontrol will result in a less stable system and slowerconvergence to the fair bandwidth allocation.Themodeling and discussion in this paper are quite generaland can be easily applied to equation-based TCP-friendlycongestion control scheme, another category ofTCP-friendly transport protocols.