Finding Good Candidate Node-Encircling Pre-configuration Cycles in Survivable WDM Mesh Networks
A fault recovery system that is fast and reliable is essential in survivability design in wavelength-division-multiplexing (WDM) mesh networks. Pre-configuration Cycle (p-cycle) benefits both the fast recovery time and the efficient resource utilization. Finding good candidate p-cycles is the first and very important step in p-cycle design. The node-encircling p-cycle can protect not only the on-cycle links and the straddling links but also the central node and the straddling flows. In this paper, we present a novel algorithm, called the Node-encircling p-Cycles Mining Algorithm (NCMA), to efficiently find good candidate node-encircling p-cycles. The qualities of p-cycles generated by our algorithm are controlled by several input parameters. The algorithm is also suitable for finding some special link p-cycles which must contain some fixed nodes. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
Taifei Zhao Lemin Li Hongfang Yu
Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks University of Electronic Science and Technology of China, Chengdu 610054, P.R. China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
1877-1881
2006-06-25（万方平台首次上网日期，不代表论文的发表时间）