摘要
p圈法是抗毁性网状WDM光网络中一种十分优秀的保护算法,在p圈配置到网状光网络的过程中,圈构造算法是设计的第一步。文中提出了一种快速圈挖掘算法(FCMA),本算法基于k-最短路由算法构造最小p圈,通过圈扩展算法获得更多性能优良圈,文中给了启发式算法的具体步骤。通过计算机仿真表明,该算法实现快速圈构造,性能优于其它同类算法,适合网状光网络中的p圈快速构造。
A fast and reliable recovery system is essential in survivability design of Wavelength-division-multiplexing (WDM) mesh networks. The Pre-configuration cycle design benefits both the fast recovery time and the efficient resource utilization. In this paper, a novel algorithm of finding cycles is presented, called the Fast Cycles Mining Algorithm (FCMA), for efficient p-cycle network design in WDM networks. The algorithm is also flexible because the number and the length of cycles generated are controlled by several input parameters. This algorithm is scalable and especially suitable tbr survivable WDM mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
出处
《光电工程》
EI
CAS
CSCD
北大核心
2007年第4期94-99,共6页
Opto-Electronic Engineering
关键词
波长分割多嘴复用
光网络
P圈
快速挖掘算法
圈构造
Wavelength division multiplexing
Opticalnetwork
P-cycle
Finding cycles
Fast cycles mining algorithm