Convergence of synchronous and asynchronous algorithms in multiclass networks
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 939-943 vol.2
- https://doi.org/10.1109/infcom.1991.147605
Abstract
The Nash equilibrium point for optimum flow control in a noncooperative multiclass environment is studied. Convergence properties of asynchronous as well as synchronous algorithms are investigated. The convergence of a greedy algorithm for the n users case is proved, and necessary and sufficient conditions for the convergence of asynchronous algorithms are obtained. Since asynchronous algorithms do not converge for all values of the weighting factors, one must be careful in their choice. An introduction to the literature and an extension of a not very widely known theorem for the convergence of Gauss-Seidel algorithms in the linear systems theory are given.Keywords
This publication has 10 references indexed in Scilit:
- A game theoretic approach to flow control in an integrated environment with two classes of usersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal decentralized flow control of Markovian queueing networks with multiple controllersPerformance Evaluation, 1991
- Distributed algorithms for the computation of noncooperative equilibriaAutomatica, 1987
- Decentralized algorithms for flow control in networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Inefficiency of Nash EquilibriaMathematics of Operations Research, 1986
- Flow Control Power is NondecentralizableIEEE Transactions on Communications, 1981
- A new approach to performance-oriented flow controlIEEE Transactions on Communications, 1981
- Free buffer allocation — An investigation by simulationComputer Networks (1976), 1978
- Chaotic relaxationLinear Algebra and its Applications, 1969
- Two-Person Cooperative GamesEconometrica, 1953