基于QPSO算法的OSPF多约束路由研究  

Research on OSPF multi constraint routing based on QPSO algorithm

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

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

出　　处：《华东师范大学学报（自然科学版）》2015年第3期91-97,共7页Journal of East China Normal University(Natural Science)

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

摘　　要：利用传统的SPF算法解决OSPF网络路由难题时,由于没有考虑多约束条件和有效利用次路径,一旦最优路径发生拥塞,网络传输性能会急剧降低.文中将QPSO算法应用于OSPF网络路由规划,利用多约束条件并结合OSPF网络多种路由参数的特性,重点对有效地改善网络局部拥塞和快速求得全局最佳路由及若干次路由算法进行探究,并利用仿真数据对所提出的改进算法进行验证.结果表明在解决OSPF网络路由规划问题中,网路传输性能,文中所提出的算法比传统的遗传算法和SPF算法得到较好的改善.The OSPF network routing problems were solved by the use of the traditional SPF algorithm.Due to not considering the multi-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 QPSO algorithm was applied to the OSPF 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 got better improvement than the genetic algorithm and the traditional SPF algorithm in the solution of route planning problem and the network transmission performance.

关 键 词：量子粒子群 内部网关协议 路由选择 服务质量 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]