Dynamic Safety-Stocks for Asymptotic Optimality in Stochastic Networks
- 61 Downloads
This paper concerns control of stochastic networks using state-dependent safety-stocks.
These results are based on the construction of an approximate solution to the average-cost dynamic programming equations using a perturbation of the value function for an associated fluid model.
Moreover, a new technique is introduced to obtain fluid-scale asymptotic optimality for general networks modeled in discrete time. The proposed policy is myopic with respect to a perturbation of the value function for the fluid model.
Keywordsqueueing networks routing scheduling optimal control
Unable to display preview. Download preview PDF.
- H. Chen and D.D. Yao, Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization (Springer-Verlag, New York, 2001) Stochastic Modelling and Applied Probability.Google Scholar
- J.G. Dai and W. Lin, Maximum pressure policies in stochastic processing networks, Operations Research, 53(2) to appear.Google Scholar
- L. Green, A queueing system with general-use and limited-use servers, Oper. Res. 33(1) (1985) 168–182.Google Scholar
- J. M. Harrison, Brownian Motion and Stochastic Flow Systems (Robert E. Krieger Publishing Co. Inc., Malabar, FL, 1990) Reprint of the 1985 original.Google Scholar
- S.G. Henderson, S.P. Meyn and V. B. Tadić, Performance evaluation and policy selection in multiclass networks, Discrete Event Dynamic Systems: Theory and Applications, 13(1/2) (2003) 149–189. Special issue on learning, optimization and decision making (invited).Google Scholar
- F.P. Kelly and C.N. Laws, Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling, QUESTA, 13 (1993) 47–86.Google Scholar
- L. Kleinrock, Queueing Systems Volume 1: Theory (Wiley, 1975).Google Scholar
- G. Koole, On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers, Math. Operations Res. 21 (1996) 469–476.Google Scholar
- V.G. Kulkarni, Modeling and Analysis of Stochastic Systems (Texts in Statistical Science Series. Chapman and Hall Ltd., London, 1995).Google Scholar
- H.J. Kushner, Heavy Traffic Analysis of Controlled Queueing and Communication Networks (Springer-Verlag, New York, 2001). Stochastic Modelling and Applied Probability.Google Scholar
- C.N. Laws, Dynamic routing in queueing networks, PhD thesis, Cambridge University, Cambridge, UK, 1990.Google Scholar
- S.P. Meyn, Stability and optimization of queueing networks and their fluid models, in: Mathematics of Stochastic Manufacturing Systems (Williamsburg, VA, 1996) pp. 175–199. Amer. Math. Soc., Providence, RI, 1997.Google Scholar
- S.P. Meyn, Workload models for Stochastic networks: Value functions and performance evaluation, in IEEE Transactions on Automatic Control, July 2005.Google Scholar
- S.P. Meyn and R.L. Tweedie, Markov Chains and Stochastic Stability (Springer-Verlag, London, 1993). online: http://black.csl.uiuc.edu/meyn/pages/book.html.
- T. Osogami, M. Harchol-Balter, A. Scheller-Wolf and L. Zhang, Exploring threshold-base policies for load sharing, in: Proceedings of the Forty-second Annual Allerton Conference on Communication, Control, and Computing, 2004.Google Scholar
- V. Tadic and S.P. Meyn, Asymptotic properties of two time-scale stochastic approximation algorithms with constant step sizes, in: American Control Conference, 2003.Google Scholar
- G. Weiss, Optimal draining of a fluid re-entrant line, in: Volume 71 of IMA volumes in Mathematics and its Applications, eds. Frank Kelly and Ruth Williams (New York, Springer-Verlag, 1995) pp. 91–103.Google Scholar