Global asymptotic stability of internet adaptive congestion control algorithm Online publication date: Tue, 04-Nov-2008
by Hong-yong Yang, Si-ying Zhang
International Journal of Systems, Control and Communications (IJSCC), Vol. 1, No. 2, 2008
Abstract: To ensure the quality of service of the network, the internet applies network congestion control algorithms to adjust the rate to improve the serving capacity. Based on the working mechanisms of internet communication systems, a dynamic internet congestion control primal dual algorithm is presented. By applying the Lyapunov stability theorem, the global asymptotic stability of the dynamic algorithm with negligible communication delays is studied. Furthermore, the global asymptotic stability of the dynamic algorithm with communication delays is analysed by means of the Lyapunov-Krasovskii theorem. Finally, computer simulations show the validity of these results.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com