Asynchronous Algorithms for Optimal Flow Control of BCMP Networks

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\u27s 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