期刊文献+

基于无环替代重路由优化的网络可生存性增强方法 被引量:1

An Approach of Enhancing Network Survivability by Optimization Based on LFA Re-routing
下载PDF
导出
摘要 为了提高网络单链路(节点)故障的快速恢复能力以增强网络可生存性,提出一种基于模拟退火粒子群优化及二分图最小点集覆盖算法的无环替代重路由技术优化方法.无环替代快速重路由技术很难实现故障完全覆盖,因此在原始拓扑基础上首先利用模拟退火粒子群算法对无环替代路径(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
  • 相关文献

同被引文献15

  • 1Woo S,Kim H.An Empirical Interference Modeling for Link Reliability Assessment in Wireless Networks[J].IEEE/ACM Transactions on Networking,2013,21(1):272-285.
  • 2Silva I,Guedes L A,Portugal P,et al.Reliability and Availability Evaluation of Wireless Sensor Networks for Industrial Applications[J].Sensors,2012,12(1):806-838.
  • 3Dhadwal D,Arora A,Singh V R.Optimization of Shared Path Protection for SONET/SDH Network[J].International Journal of Scientific and Engineering Research,2014,5(7):1258-1264.
  • 4Kamamura S,Miyamura T,Pelsser C,et al.Minimum Backup Configuration-creation Method for IP Fast Reroute[C]//Proceedings of GLOBECOM’09.Honolulu,USA:IEEE Press,2009:1-6.
  • 5Wang J,Qiao C,Yu H.On Progressive Network Recovery After a Major Disruption[C]//Proceedings of the 30th IEEE International Conference on Computer Communications.Washington D.C.,USA:IEEE Press,2011:1925-1933.
  • 6Yu H,Yang C.Partial Network Recovery to Maximize Traffic Demand[J].IEEE Communications Letters,2011,15(12):1388-1390.
  • 7Horie T,Hasegawa G,Kamei S,et al.A New Method of Proactive Recovery Mechanism for Large-scale Network Failures[C]//Proceedings of the 23rd IEEE International Conference on Advanced Information Networking and Applications.Bradford,UK:IEEE Press,2009:951-958.
  • 8Maurras J F,Vanier S.Network Synthesis Under Survivability Constraints[J].Quarterly Journal of the Belgian,French and Italian Operations Research Societies,2004,2(1):53-67.
  • 9Madry A.Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms[C]//Proceedings of the 42nd ACM Symposium on Theory of Computing.New York,USA:ACM Press,2010:121-130.
  • 10Xu K,Liu H,Liu J,et al.LBMP:A Logarithm-barrierbased Multipath Protocol for Internet Traffic Management[J].IEEE Transactions on Parallel and Distributed Systems,2011,22(3):476-488.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部