摘要
为了提高网络单链路(节点)故障的快速恢复能力以增强网络可生存性,提出一种基于模拟退火粒子群优化及二分图最小点集覆盖算法的无环替代重路由技术优化方法.无环替代快速重路由技术很难实现故障完全覆盖,因此在原始拓扑基础上首先利用模拟退火粒子群算法对无环替代路径(LFA)数量基于权值进行最大寻优,对经过权值优化无法实现故障完全覆盖的网络,再通过两次链路增补过程以达到LFA全备份的目的.实验结果表明该方法不仅能实现网络所有单链路(节点)的无环替代,增强了网络可生存性,同时相较原始拓扑能有效地减少增补链路数.
Aiming at improving network single link(node)failure fast recovery capability to enhance network survivability,a optimization methods is proposed based on LFA re-routing technology integrating the optimization of links weights on the base of PSO algorithm based on Simulated Annealing with minimal set cover algorithm based on bipartite graph.As LFA is hard to promise full coverage for all possible failure cases,PSO algorithm based on Simulated Annealing is used to optimize link weights for maximizing the numbers of LFA on the basis of original topology.Considering some networks is not also achieved full LFA failure full coverage after the optimization of link weights,then,the twice processes of supplement links is used to attain failure full backups.The experiment results show that this method proposed can not only keep all single link(node)failure with full LFA and enhance network survivability,but also effectively reduce the numbers of supplement links compared with the original topology.
出处
《微电子学与计算机》
CSCD
北大核心
2014年第10期48-51,共4页
Microelectronics & Computer
基金
国家自然科学基金(61201209)
陕西省自然科学基金(2013JQ8013)
关键词
可生存性
无环替代
模拟退火粒子群
二分图
survivability
Loop-Free Alternates
PSO based on Simulated Annealing
bipartite graph