摘要
为保证波分复用光网络单链路在尽可能短的时间实现快速恢复,提出一种与并行算法相结合的启发式P圈配置算法。找出网络拓扑中所有的备选P圈,结合并行算法实现网络中保护效率比较大的P圈优先配置。仿真结果表明,该并行算法适用于数据量较大的P圈配置,在数据量达到一定程度时,计算时间的加速比随着网络中配置P圈数据量的变化呈正比例增加。
In order to ensure the Wave Division Multiplexing（WDM） optical network to achieve fast speed protection and restoration of optical network against single link failure, the parallel algorithm combined with heuristic algorithm of P-cycle configuration is proposed in this paper. The main idea of this algorithm is to find all candidate cycles in network under some limitations and then use multi-process to parallel calculate the Efficiency Ratio（ER） of all P-cycles, select a P-cycle with the maximum efficiency ratio and configure it. Simulation results show that this parallel algorithm is more suitable for large amounts of P-cycles configuration, and the speedup gets better as the number of P-cycles configuration increases. [Key words] P-cycle; parallel algorithm; speedup ratio; Efficiency Ratio（ER） of protection; heuristic
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第24期55-57,共3页
Computer Engineering
基金
国家"973"计划基金资助项目(2010CB328203)
广西研究生教育创新计划基金资助项目(105930901022)
广西大学科研基金资助项目(X071032
XB2100101)
关键词
P圈
并行算法
加速比
保护效率比
启发式
P-cycle
parallel algorithm
speedup ratio
Efficiency Ratio（ER） of protection
heuristic
