[1] GROVER W.D,STAMATELAKIS D.Cycle-oriented Distributed Preconfiguration:Ring-like Speed with Mesh-like Capacity for Self-planning NetworkRestoration[A].In Proc.of IEEE ICC 1998[C].[sl]:[sn],1998.537-543.

[2] JOHNSON D.B.Finding All the Elementary Circuits of a Directed Graph[J].SIAM J.on Computing,1975,4:77-84.

[3] ZHANG H,YANG O.Finding Protection Cycles in DWDM Networks[A].Proc.of IEEE ICC 2002[C].[sl]:[sn],2002.2756-2760.

[4] Chang LIU,Lu RUAN.Finding Good Candidate Cycles for Efficient p-Cycle Network Design[A].in Proc.of IEEE ICCCN 2004[C].[sl]:[sn],2004.321-326.

[5] DOUCETTE J,HE D,GROVER W.D,et al.Algorithmic Approaches for Efficient Enumeration of Candidate p-Cycles and Capacitated p-Cycle Network Design[A].in Proc.Of DRCN 2003[C].[sl]:[sn],2003.212-220.

[6] MACGREGOR M.H,GROVER W.D.Optimized K-shortest Paths Algorithm for Facility Restoration[J].Software-Practice & Experience,1994,24:823-834.

[7] GROVER W.D,DOUCETTE J.E.Advances in Optical Network Design with p-Cycles:Joint Optimization and Pre-selection of Candidate p-Cycles[A].in Proc.of the IEEE-LEOS Summer Topical Meeting on All Optical Networking[C].[sl]:[sn],2002.WA2-49-WA2-50.

[8] LISTANTI M,BERDUSCO M,SABELLA R.Optical Path Strategies in WDM All-optical Networks:Minimization of Wavelength Converters in Optical Cross-connect[A].in Proc.of IEEE GLOBECOM'97[C].[sl]:[sn],1997.S16.7.

[9] BATCHELOR P.Ultra High Capacity Optical Transmission Networks:Final Report of Action COST 239[EB/OL].http://web.cnlab.ch/cost239/,1999.