Solving Static Traffic Grooming with an Auxiliary Graph Model in WDM Mesh Networks
暂无分享,去创建一个
[1] Arun K. Somani,et al. Analysis of optical networks with heterogeneous grooming architectures , 2004, IEEE/ACM Transactions on Networking.
[2] Biswanath Mukherjee,et al. A comprehensive study on next-generation optical grooming switches , 2003, IEEE J. Sel. Areas Commun..
[3] Biswanath Mukherjee,et al. Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..
[4] Chunming Qiao,et al. Traffic grooming in mesh WDM optical networks - performance analysis , 2004, IEEE Journal on Selected Areas in Communications.
[5] Biswanath Mukherjee,et al. Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming , 2003, IEEE Netw..
[6] B. Ramamurthy,et al. A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks , 2005, IEEE Journal on Selected Areas in Communications.
[7] George N. Rouskas,et al. Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..
[8] Biswanath Mukherjee,et al. A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.
[9] Biswanath Mukherjee,et al. Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[10] A.L. Chiu,et al. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.