Computing MDP cost function for high speed networks with sample-path and quantization
暂无分享,去创建一个
In this paper, we apply two techniques to the cost computation in the networking problems. The sample-path-based performance potential theory removes the need of knowing the exact system parameters. Cost quantization, on the other hand, reduces the state space to a manageable size. Numerical results show that considerable computation efforts can be saved without degrading the performance significantly.
[1] Xi-Ren Cao,et al. Single sample path based optimization of Markov systems: examples and algorithms , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.
[2] Xi-Ren Cao,et al. Perturbation realization, potentials, and sensitivity analysis of Markov processes , 1997, IEEE Trans. Autom. Control..
[3] R. Howard. Dynamic Programming and Markov Processes , 1960 .