Suboptimality bounds in stochastic control: A queueing example

Proceedings of the American Control Conference

Volumn 2006, Issue , 2006, Pages 1642-1647

  Cogill, Randy ^a   Lall, Sanjay ^b  

^a Stanford University   (United States)

^b 496 Lomita Mall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; COSTS; MARKOV PROCESSES; OPTIMAL CONTROL SYSTEMS;

CONTROL POLICIES; MARKOV DECISION PROCESSES; QUEUING SYSTEMS; SERVICE RATES;

STOCHASTIC CONTROL SYSTEMS;

EID: 34047227353     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2006.1656454     Document Type: Conference Paper

References (10)

1. E. Altman and A. Schwartz. Optimal priority assignment: a time sharing approach. IEEE Trans. Automatic Control, 34:1089-1102, 1989.
2. J.S. Baras, A.J. Dorsey, and A.M. Makowski. K competing queues with geometric service requirements and linear costs: the μc rule is always optimal. Systems and Control Letters, 6:173-180, 1985.
3. D. Bertsimas, D. Gamarnik, and J.N. Tsitsiklis. Performance of multiclass Markovian queueing networks via piecewise linear lyapunov functions. Ann. Applied Probability, 11(4):1384-1428, 2001.
4. C. Buyukkoc, P. Varaiya, and J. Walrand. The cμ, rule revisited. Advances in Applied Probability, 17:237-238, 1985.
5. D.R. Cox and W.L. Smith. Queues. John Wiley, New York, 1961.
6. L. Kleinrock. Queueing Systems. Volume II: Computer Applications. John Wiley, New York, 1976.
7. S. Kumar and P.R. Kumar. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automatic Control, 39(8):1600-1611, 1994.
8. S. Meyn and R. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, 1993.
9. A.R. Odoni. On finding the maximal gain for Markov decision processes. Operations Research, 17:857-860, 1969.
10. P.J. Schweitzer and A. Seidmann. Generalized polynomial approximations in Markovian decision processes. J. Mathematical Analysis and Applications, 110:568-582, 1985.