基于PSO算法的OSPF多约束路由策略  

Research on OSPF Multi Constraint Routing Tactics Based on PSO Algorithm

作　　者：江家宝[1] 郑尚志[1] 

机构地区：[1]巢湖学院信息工程学院,安徽巢湖238000

出　　处：《软件导刊》2015年第6期76-79,共4页Software Guide

基　　金：安徽省高等教育振兴计划项目(2013zytz063)

摘　　要：利用传统SPF算法解决OSPF网络路由难题时,由于没有考虑多约束条件和有效利用次路径,一旦最优路径发生拥塞,网络传输性能将急剧降低。将PSO算法应用于OSPF网络路由规划,利用多约束条件并结合OSPF网络多种路由参数的特性,重点对有效改善网络局部拥塞和快速求得全局最佳路由及若干次路由算法进行探究,并利用仿真数据对所提出的改进算法进行验证。结果表明,在解决OSPF网络路由规划问题中,PSO算法较传统遗传算法和SPF算法能实现网路传输性能更优。The OSPF network routing problems were solved by the use of traditional SPF algorithm, due to not considering the muhi-constraint conditions and the effective use of secondary path, once the optimal path occurs to congestion, the network transmission performance will be decreased dramatically. In this paper, the PSO algorithm was applied to the OS- PF network routing planning, used by multi-constraint conditions and combined by the characteristics of OSPF network and a variety of routing parameters, which was effectively improved by the local network congestion and obtained the global optimum fast routing and routing algorithm, and verified the improved algorithm by using the simulation data. The results showed that the proposed algorithm gets better improvement than the genetic algorithm and the traditional SPF algo rithm in the solution of route planning problem and the network transmission performance.

关 键 词：PSO算法 OSPF 网络路由器 多约束路由 QoS 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]