Stability of End-to-End Rate-based Congestion Control Algorithm
Hongyong Yang, Fusheng Wang, Jun Liu · 2006
A class of end-to-end rate-based congestion control algorithms with communication delays is studied. Based on the Lyapunov-Razumikhin theorem, the Lyapunov stability of the algorithm is analyzed. The global attractability of the algorithm is proved by applying Barbalat Lemma. A more concise criterion to ensure the global asymptotical stability (GAS) is obtained. The new result presents a simple upper delay bound, and enlarges the admissible upper delay bound. Finally, an example is given to support the new result