Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

  title={Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm},
  author={Alexander L. Stolyar},
  journal={Queueing Syst.},
We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision “produces” a certain vector of “commodities”; it also has associated “traditional” queueing control effect, i.e., it determines traffic (customer) arrival rates, service rates at the nodes, and random routing of processed customers among the nodes. The problem is to find a… CONTINUE READING
Highly Influential
This paper has highly influenced 31 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 496 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 330 extracted citations

497 Citations

Citations per Year
Semantic Scholar estimates that this publication has 497 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 26 references

The Mathematics of Internet Congestion Control (Birkhauser

  • R. Srikant
  • 2004
1 Excerpt

A duality model of TCP and queue management algorithms

  • S. Low
  • IEEE/ACM Transactions on Networking 11(4)
  • 2003
1 Excerpt

Centralized power control for multi-hop wireless networks

  • T. Klein, H. Viswanathan
  • 2003
3 Excerpts

Similar Papers

Loading similar papers…