Convergence of synchronous and asynchronous algorithms in multiclass networks

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 con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Infocom '91: Networking in the 90's : Proceedings of the Tenth Annual Joint Conference of the IEEE Computer and Communications Societies s. 939 - 943 vol.2
Hlavní autoři: Zhang, Z., Douligeris, C.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1991
Témata:
Convergence
Delay
Greedy algorithms
Intelligent networks
Iterative algorithms
Nash equilibrium
Power measurement
Sufficient conditions
Telecommunication control
Throughput
ISBN:0879426942, 9780879426941
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.< >
ISBN:0879426942
9780879426941
DOI:10.1109/INFCOM.1991.147605