An effective numerical method for controlled routing in large trunk line networks
暂无分享,去创建一个
[1] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[2] Robert Doverspike,et al. Comparison of Routing Methods for DCS-Switched Networks , 1993 .
[3] K. R. Krishnan,et al. Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic , 1992, Ann. Oper. Res..
[4] Debasis Mitra,et al. State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design , 1992, Ann. Oper. Res..
[5] F. P. Kelly,et al. Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..
[6] M. Akian. Re´solution nume´rique d'equations d'Hamilton-Jacobi-Bellman-au moyen d'algorithmes multigrilles et d'ite´rations sur les politiques , 1988 .
[7] Dimitri P. Bertsekas,et al. Dynamic Programming: Deterministic and Stochastic Models , 1987 .
[8] Harold J. Kushner,et al. Approximation and Weak Convergence Methods for Random Processes , 1984 .
[9] P. Billingsley,et al. Convergence of Probability Measures , 1970, The Mathematical Gazette.