The choice of the best among the shortest routes in transparent optical networks
暂无分享,去创建一个
André Soares | Gilvan M. Durães | William Giozza | José Roberto Amazonas | A. Soares | J. Amazonas | W. Giozza | G. Durães
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] Jiangchuan Liu,et al. Analysis of sparse-partial wavelength conversion in wavelength-routed WDM networks , 2004, IEEE INFOCOM 2004.
[3] Hwa-Chun Lin,et al. Traffic Intensity Based Fixed-Alternate Routing in All-Optical WDM Networks , 2006, 2006 IEEE International Conference on Communications.
[4] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[5] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[6] A. Jhunjhunwala,et al. Load balanced routing to enhance the performance of optical backbone networks , 2008, 2008 5th IFIP International Conference on Wireless and Optical Communications Networks (WOCN '08).
[7] Dominic A. Schupke,et al. Service Oriented Traffic Models for Future Backbone Networks , 2007 .
[8] M. J. O'Mahony. A European optical network: design considerations , 1994 .
[9] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[10] C. Siva Ram Murthy,et al. WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .
[11] Eytan Modiano,et al. On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks , 2006, TNET.