Congestion control using an improved variant of the AIMD scheme
Eugenius Kaszkurewicz, Amit Bhaya · 2006
The additive-increase multiplicative-decrease (AIMD) congestion control algorithm is approached from a variable structure control perspective, leading to a variant of this classical algorithm in which a (sliding) equilibrium can be attained, while giving preference to either fairness or full link utilization in the reaching phase. The price to be paid is that each source must have information on the sending or injection rates of its neighbor(s), in addition to the usual bit of information regarding congestion in the bottleneck link(s). Simulations are presented showing the improved responsiveness and smoothness of convergence of the injection rates to a fair, full utilization equilibrium in the presence of delays