Suboptimality Bounds in Stochastic Control: A Queueing Example

  title={Suboptimality Bounds in Stochastic Control: A Queueing Example},
  author={Randy Cogill and Sanjay Lall},
  journal={2006 American Control Conference},
In this paper we consider Markov decision processes with average cost criteria, and discuss an approach for characterizing the performance loss associated with using a suboptimal control policy. Because there are often difficulties associated with computing and implementing optimal control policies, heuristic control policies are often used in practice. For such a policy, we would like to be able to compute guaranteed bounds on its performance, specifically its performance relative to an… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


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


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

Markov Chains and Stochastic Stability

  • S. Meyn, R. Tweedie
  • Springer-Verlag
  • 1993
1 Excerpt

Optimal priority assignment: a time sharing approach

  • E. Altman, A. Schwartz
  • IEEE Trans. Automatic Control, 34:1089–1102
  • 1989
1 Excerpt

Generalized polynomial approximations in Markovian decision processes

  • P. J. Schweitzer, A. Seidmann
  • J. Mathematical Analysis and Applications, 110…
  • 1985
1 Excerpt

K competing queues with geometric service requirements and linear costs: the μc rule is always optimal

  • J. S. Baras, A. J. Dorsey, A. M. Makowski
  • Systems and Control Letters, 6:173–180
  • 1985
2 Excerpts

The cμ rule revisited

  • C. Buyukkoc, P. Varaiya, J. Walrand
  • Advances in Applied Probability, 17:237–238
  • 1985
2 Excerpts

Queueing Systems

  • L. Kleinrock
  • Volume II: Computer Applications. John Wiley, New…
  • 1976
1 Excerpt


  • D. R. Cox, W. L. Smith
  • John Wiley, New York
  • 1961
1 Excerpt

Similar Papers

Loading similar papers…