Convergence of Dual Algorithm with Arbitrary Communication Delays

We study the issue of convergence of user rates and resource prices under a family of rate control schemes called dual algorithms with arbitrary communication delays. We first consider a case where a single resource is shared by many users. Then, we study a general network shared by heterogeneous users and derive sufficient conditions for convergence. We show that in the case of a single user utilizing a single resource, our condition is also necessary. Using our results we derive a sufficient condition for convergence with a family of popular utility and resource price functions. We present numerical examples to validate our analysis.

• Type: Journal
• Year: 2008
• Where: SIAMAM
• Authors: Richard J. La, Priya Ranjan
• Keywords: Resource Price, SIAMAM 2008, Single Resource, Sufficient Condition