Abstract

International audience; It is shown that the queuing delay involved in the congestion control algorithm is state-dependent and does not depend on the current time. Then, using an accurate formulation for buffers, networks with arbitrary topologies can be built. At equilibrium, our model reduces to the widely used setup by Paganini et al. Using this model, the delay-derivative is analyzed and it is proved that the delay time-derivative does not exceed one for the considered topologies. It is then shown that the considered congestion control algorithm globally stabilizes a delay-free single buffer network. Finally, using a specific linearization result for systems with state-dependent delays from Cooke and Huang, we show the local stability of the single bottleneck network.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1109/cdc.2010.5717857
https://people.kth.se/~kallej/papers/network_cdc10.pdf,
http://www.diva-portal.org/smash/record.jsf?pid=diva2:478588,
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005717857,
http://www.briat.info/slides/CDC10_Congestion.pdf,
https://hal.archives-ouvertes.fr/hal-00575213,
https://hal.archives-ouvertes.fr/hal-00575213/document,
http://people.kth.se/~hsan/publications_files/CDC2010B.pdf,
https://academic.microsoft.com/#/detail/2138076221
https://hal.archives-ouvertes.fr/hal-00575213/document,
https://hal.archives-ouvertes.fr/hal-00575213/file/CDC10_final.pdf
Back to Top

Document information

Published on 01/01/2010

Volume 2010, 2010
DOI: 10.1109/cdc.2010.5717857
Licence: CC BY-NC-SA license

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?