Asynchronous Algorithms for Optimal Flow Control of BCMP Networks

Authors

Andreas D. Bovopoulos, Washington University in St. Louis
Aurel A. Lazar, Columbia University

Document Type

Technical Report

Publication Date

1989-02-24

Filename

WUCS-89-10.pdf

Technical Report Number

WUCS-89-10

Abstract

The decentralized flow control problem for an open multiclass BCMP network is studied. The power based optimization criterion is employed for the derivation of the optimal flow control for each of the network's users. It is shown that that optimal arrival rates correspond to the unique Nash equilibrium point of a noncooperative game problem. Asynchronous algorithms are presented for the computation of the Nash equilibrium point of the network. Among them, the nonlinear Gauss-Seidel algorithms is distinguished for its robustness and speed of convergence.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7610XQ1

Recommended Citation

Bovopoulos, Andreas D. and Lazar, Aurel A., "Asynchronous Algorithms for Optimal Flow Control of BCMP Networks" Report Number: WUCS-89-10 (1989). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/723