An Optimal Route Computation Method for GMPLS Based Survivable Network with a Tabu Search Algorithm for the Weighted Constraint Satisfaction Problem
暂无分享,去创建一个
N. Ogino | H. Nakamura | T. Nitta | M. Sato | S. Konishi | H. Furuya | T. Tanabe
[1] Biswanath Mukherjee,et al. Some principles for designing a wide-area WDM optical network , 1996, TNET.
[2] Biswanath Mukherjee,et al. Connection management for survivable wavelength-routed wdm mesh networks , 2001 .
[3] Byrav Ramamurthy,et al. Wavelength conversion in WDM networking , 1998, IEEE J. Sel. Areas Commun..
[4] Kumar N. Sivarajan,et al. Design of Logical Topologies for Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..
[5] Dimitri Papadimitriou,et al. Network Working Group Generalized Multi-protocol Label Switching (gmpls) Recovery Functional Specification , 2006 .
[6] Toshihide Ibaraki,et al. A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..
[7] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[8] Toshihide Ibaraki,et al. An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem , 2001 .
[9] Yufei Wang,et al. Optical network design and restoration , 1999, Bell Labs Technical Journal.
[10] Ayan Banerjee,et al. Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques , 2001, IEEE Commun. Mag..