Stability of the primal-dual algorithm for congestion control

Authors: Tian, Y.-P.1; Chen, G.2

Source: International Journal of Control, Volume 79, Number 6, June 2006 , pp. 662-676(15)

Publisher: Taylor and Francis Ltd

Buy & download fulltext article:

OR

Price: $56.94 plus tax (Refund Policy)

Abstract:

This paper investigates the stability of the primal-dual algorithm for Internet congestion control in the presence of heterogeneous round-trip communication delays. Based on the geometric analysis of frequency response functions of the congestion control system, some sufficient conditions for the local asymptotic stability of the primal-dual algorithm are established. Compared to the existing references, the main contribution of this paper is that in addition to the new sufficient conditions it also obtains some scalability conditions under which the decentralized stability criteria hold for the primal-dual algorithm.

Document Type: Research article

DOI: http://dx.doi.org/10.1080/00207170600622833

Affiliations: 1: Department of Automatic Control, Southeast University, Nanjing, 210096, China 2: Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong, China

Publication date: 2006-06-01

More about this publication?
Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page