Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment

DOI10.1109/26.156630zbMath0825.90387OpenAlexW2109006960MaRDI QIDQ4030257

Zhensheng Zhang, Christos Douligeris

Publication date: 1 April 1993

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1534c75629d9d1b6c4eba7dc582fd65904fa442a

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (2)

Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing ⋮ A paradox in optimal flow control of \(M/M/n\) queues

This page was built for publication: Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment