[1] Lei L,Zhao J,Ji Y. Acta Photonica Sinica,2004,33 (2):174~178
[2] He H,Fan G.ActaPhotonica Sinica,2005,34(2):259~262
[3] Grover W D,Stamatelakis D. Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. 1998 IEEE International Conference on Communications,Atlanta,USA,1998,1:537~543
[4] Zhu G,Zeng Q,Ye T,et al. Protection switching schemes of multi-granularity p-cycles in survivable WDM networks. Chinese Optics Letters,2004,2(9):508~511
[5] Song H,Xu Y,Gu W. Acta Photonica Sinica,2004,33(9):1090~1094
[6] Schupke D A,Gruber C G,Autenrieth A. Optimal configuration of p-cycles in WDM networks. IEEE 2002 International Conference on Communications,New York,USA,2002,5:2761~2765
[7] Chen C,Banerjee S. A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. 15th Annual Joint Conference of the IEEE Computer and Communications Societies,San Francisco,USA. 1996,1:164~171
[8] Shen G,Grover W D. Design and performance of protected working capacity envelops based on p-cycles for dynamic provisioning of survivable services. OSA Journal of Optical Networking,2005,4(7):361~390
[9] Hyyti E. Heuristic algorithms for the generalized routing and wavelength assignment problem. Seventeenth Nordic Teletraffic Seminar,Fornebu,Norway,2004: 373~386
[10] Doucette J,He D,Grover W D,et al. Algorithmic approaches for efficient enumeration of candidate pcycles and capacitated p-cycle network design. Fourth International Workshop on the Design of Reliable Communication Networks,Banff,Canada,2003: 212~220
[11] Zhang Z,Zhong W,Mukherjee B. A heuristic method for design of survivable WDM networks with p-cycles.IEEE Communications Letters,2004,8(7):467~469
[12] Johnson D B. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing,1975,4(1):77~84