Stability and performance analysis of a congestion control algorithm for networks

In this paper, we show that max-min fair congestion control methods with a stable symmetric Jacobian remain stable under arbitrary feedback delay and the stability condition of such methods does not involve any of the delays. To demonstrate the practicality of the obtained result, we change the original algorithm in Kelly´s work to become robust under random feedback delay and fixed constants of the control equation. The performance analysis shows that it offers smooth sending rate, exponential convergence to efficiency, and fast convergence to fairness, all of which make it be meaningful for future high-speed networks.