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
A theoretical analysis of feedback flow control
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Competitive dynamic bandwidth allocation
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Promoting the use of end-to-end congestion control in the Internet
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
Understanding TCP vegas: a duality model
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamic behavior of slowly-responsive congestion control algorithms
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A randomized online algorithm for bandwidth utilization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On-Line End-to-End Congestion Control
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
TCP-Friendly SIMD Congestion Control and Its Convergence Behavior
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly probe available bandwidth, which may affect its stability. This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.