Value Functions and Performance Evaluation in Stochastic Network Models

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2003, Pages 2612-2617

  Borkar, V S ^a   Meyn, S P ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; BROWNIAN MOVEMENT; COMPUTER SIMULATION; FUNCTIONS; LINEAR PROGRAMMING; LYAPUNOV METHODS; OPTIMIZATION; PROBLEM SOLVING;

CONTROLLED BROWNIAN MOTION (CBM); CONTROLLED RANDOM-WALK (CRW);

STOCHASTIC CONTROL SYSTEMS;

EID: 1542288805     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. S. Asmussen. Queueing simulation in heavy traffic. Math. Operations Res., 17:84-111, 1992.
2. D. Bertsimas, I. Paschalidis, and J. N. Tsitsiklis. Optimization of multiclass queueing networks: polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab., 4:43-75, 1994.
3. V. S. Borkar and S. P. Meyn. Value functions and limit theory for Brownian network models, (in preparation), 2003.
4. H. Chen and D. D. Yao. Fundamentals of queueing networks: Performance, asymptotics, and optimization. Springer-Verlag, New York, 2001. Stochastic Modelling and Applied Probability.
5. M. Chen, R. Dubrawski, and S. P. Meyn. Management of demand-driven production systems. Submitted for publication, 2002.
6. M. Chen, C. Pandit, and S. P. Meyn. In search of sensitivity in network optimization. To appear, Queueing Systems, and invited presentation at the 11TH INFORMS Applied Probability Society Conference, 2001.
7. R-R. Chen and S. P. Meyn. Value iteration and optimization of multiclass queueing networks. Queueing Systems: Theory and Applications, 32(1-3):65-97, 1999.
8. P. Dupuis and K. Ramanan. Convex duality and the Skorokhod problem. I, II. Probab. Theory Related Fields, 115(2):153-195, 197-236, 1999.
9. J. M. Harrison. Brownian Motion and Stochastic Flow Systems. Wiley, New York, NY, 1985.
10. S. G. Henderson and P. W. Glynn. Approximating martingales for variance reduction in Markov process simulation. Mathematics of Operations Research, 2002. To appear.
11. S.G. Henderson, S. P. Meyn, and V. Tadic. Performance evaluation and policy selection in multiclass networks. Discrete Event Dynamic Systems: Theory and Applications, 13:149-189, 2003. Special issue on learning and optimization methods (invited).
12. S.G. Henderson and S.P. Meyn. Variance reduction for simulation in multiclass queueing networks. To appear, IIE Transactions on Operations Engineering, 2003.
13. P. R. Kumar and S. P. Meyn. Duality and linear programs for stability and performance analysis queueing networks and scheduling policies. IEEE Trans. Automat. Control, 41(1):4-17, 1996.
14. S. Kumar and P. R. Kumar. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automat. Control, AC-39:1600-1611, August 1994.
15. H. J. Kushner. Heavy traffic analysis of controlled queueing and communication networks. Springer-Verlag, New York, 2001. Stochastic Modelling and Applied Probability.
16. S. P. Meyn. The policy iteration algorithm for average reward Markov decision processes with general state space. IEEE Trans. Automat. Control, 42, 1997. also presented at the 35th IEEE Conference on Decision and Control, Kobe, Japan, December, 1996.
17. S. P. Meyn. The policy iteration algorithm for average reward Markov decision processes with general state space. IEEE Trans. Automat. Control, 42, 1997. also presented at the 35th IEEE Conference on Decision and Control, Kobe, Japan, December, 1996.
18. S. P. Meyn. Sequencing and routing in multiclass queueing networks. Part I: Feedback regulation. SLAM J. Control Optim., 40(3):741-776, 2001.
19. S. P. Meyn. Sequencing and routing in multiclass queueing networks. Part II: Workload relaxations. SIAM J. Control Optim., 42(1): 178-217, 2003. Presented at the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, June 25 - June 30.
20. S. P. Meyn. Sequencing and routing in multiclass queueing networks. Part II: Workload relaxations. SIAM J. Control Optim., 42(1): 178-217, 2003. Presented at the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, June 25 - June 30.
21. S. P. Meyn. Value functions, optimization, and performance evaluation in stochastic network models, (submitted for publication), 2003.
22. S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, London, 1993.
23. J. R. Morrison and P. R. Kumar. New linear program performance bounds for queueing networks. J. Optim. Theory Appl., 100(3):575-597, 1999.
24. E. Schwerer. A Linear Programming Approach to the Steady-state Analysis of Markov Processes. PhD thesis, Stanford University, 1997.
25. W. Whitt. Planning queueing simulations. Management Science, 35:1341-1366, 1994.