Solution of a 200-Node p-Cycle Network Design Problem with GA-Based Pre-Selection of Candidate Structures
暂无分享,去创建一个
[1] Wayne D. Grover,et al. Approaches to p-cycle network design with controlled optical path lengths in the restored network state , 2008 .
[2] Wayne D. Grover,et al. Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..
[3] Pin-Han Ho,et al. A Comparative Study of Fast Protection Schemes in WDM Mesh Networks , 2008, 2008 IEEE International Conference on Communications.
[4] Wayne D. Grover,et al. Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).
[5] Brigitte Jaumard,et al. A Column Generation Approach for Design of Networks using Path-Protecting p -Cycles , 2007 .
[6] Thomas K. Stidsen,et al. Joint Routing and Protection Using p-cycles , 2005 .
[7] Wayne D. Grover,et al. Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.
[8] Wayne D. Grover,et al. Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .