A Markov decision process model for dynamic wavelength allocation in WDM networks
暂无分享,去创建一个
[1] I. Lambadaris,et al. Optimal service allocation among two heterogeneous traffic types with no queueing , 1987, 26th IEEE Conference on Decision and Control.
[2] George N. Rouskas,et al. A path decomposition approach for computing blocking probabilities in wavelength-routing networks , 2000, TNET.
[3] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[4] Biswanath Mukherjee,et al. Dynamic lightpath establishment in wavelength-routed WDM networks , 2001, IEEE Commun. Mag..
[5] Harmen R. van As,et al. Service-specific resource allocation in WDM networks with quality constraints , 2000, IEEE Journal on Selected Areas in Communications.
[6] Jerome Talim,et al. Controlling the robots of Web search engines , 2001, SIGMETRICS '01.
[7] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[8] S. Lippman. Semi-Markov Decision Processes with Unbounded Rewards , 1973 .
[9] Keith W. Ross,et al. The stochastic knapsack problem , 1989, IEEE Trans. Commun..