Computing loss probability for dynamic traffic grooming in optical networks with wavelength conversion
暂无分享,去创建一个
[1] Chunsheng Xin. Computing blocking probability of dynamic traffic grooming in mesh WDM optical networks , 2004, First International Conference on Broadband Networks.
[2] Keith W. Ross,et al. Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..
[3] George N. Rouskas,et al. A path decomposition approach for computing blocking probabilities in wavelength-routing networks , 2000, TNET.
[4] Kumar N. Sivarajan,et al. Blocking in all-optical networks , 2004, IEEE/ACM Transactions on Networking.
[5] Biswanath Mukherjee,et al. A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.
[6] Chunming Qiao,et al. Traffic grooming in mesh WDM optical networks - performance analysis , 2004, IEEE Journal on Selected Areas in Communications.
[7] Biswanath Mukherjee,et al. Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming , 2003, IEEE Netw..
[8] Biswanath Mukherjee,et al. Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..
[9] Suresh Subramaniam,et al. All-optical networks with sparse wavelength conversion , 1996, TNET.