期刊文献+

基于粒子群权值优化的网络可生存性增强方法 被引量:3

Approach of enhancing network survivability by optimizing weights based on particle swarm optimization
在线阅读 下载PDF
导出
摘要 针对网络中发生频率最高的单链路瞬时故障,提出了一种应用粒子群算法优化链路权值来增强网络可生存性的方法。引入费用函数对利用率过高的链路赋以惩罚性的高费用来避免链路过载,以网络在无故障场景下最高链路费用与单链路故障场景下最高链路费用的加权和作为目标函数,建立了优化算法模型,并应用粒子群优化算法求解最优权值。实验结果表明,算法求得的权值可以使网络在故障条件下保持较低的链路利用率,避免了因流量转移而造成网络拥塞,增强了网络可生存性。 As most of network failures are transient single link failures,a new approach of using Particle Swarm Optimization(PSO) algorithm to optimize link weights for enhancing network survivability was proposed.A cost function was introduced to put high cost on links with high utilizations for avoiding link overloaded.The objective function was a weighted sum of two proportions: one is the maximum cost under normal state,and the other is the maximum link cost under all single link failures.Then the algorithm model was built and PSO algorithm was used to find the optimal weights.The experimental results show that the weight calculated by the proposed method can keep lower link utilization under failure states,and prevent the network from congestion due to traffic diversion.Therefore,the network survivability can be improved.
出处 《计算机应用》 CSCD 北大核心 2012年第1期127-130,共4页 journal of Computer Applications
基金 陕西省自然科学基金资助项目(SJ08F14 2009JQ8008)
关键词 瞬时故障 链路权值 粒子群优化 流量工程 可生存性 transient failure link weight Particle Swarm Optimization(PSO) traffic engineering survivability
  • 相关文献

参考文献10

二级参考文献127

  • 1顾复昌.清酒——日本国家的名酒[J].上海调味品,1993(4):3-6. 被引量:3
  • 2韩北忠,吕佳.冷热处理对低酒度葡萄酒稳定性的影响[J].食品工业科技,1993,14(2):44-46. 被引量:3
  • 3朱仁华,唐丹凤,浓嵘,翟珠峰.黄酒不稳定性成因的探讨[J].食品科学,1993,14(7):41-45. 被引量:18
  • 4范贵增,饶绍信.啤酒的早期混浊及其预防[J].江西科学,1994,12(4):255-260. 被引量:2
  • 5大连轻工业学院 无锡轻工业学院.酿造酒工艺学[M].北京:中国轻工业出版社,1987..
  • 6Pierre Francois, Mike Shand, Olivier Bonaventure. Disruption free topology reconfiguration in OSPF networks[ A]. Proceedings of INFOCOM 2007 [ C ]. Anchorage, AK: IEEE Press, 2007.89 - 97.
  • 7P Narvaez. Routing Reconfiguration in IP Networks[ D]. Massachusetts, USA: Massachusetts Institute of Technology, 2000.
  • 8Karthik Lakshminarayanan, Matthew Caesar, Murali Rangan, Tom Anderson, Scott Shenker, Ion Stoica. Achieving convergence-free routing using failure-carrying packets [ A ]. Proceedings of ACM SIGCOMM 2007 [ C ]. Kyoto, Japan: ACM Press,2007,37(4) :241 - 252.
  • 9C Alaettinoglu, V Jacobson, H Yu. Towards Millisecond IGP Convergence [ EB/OL ]. http://www. nanog. org/meetings/ nanog20/abstracts. php? pt = MTA3MiZuYW5vZzIw&nm = nanog20,2000.
  • 10Pierre Francois, Clarence Filsfils, John Evans, Olivier Bonaventure. Achieving subsecond IGP convergence in large IP networks [ J ]. ACM SIGCOMM Computer Communication Review, 2005,35 (2) : 35 - 44.

共引文献23

同被引文献30

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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