改进的最短路径算法在多点路由上的应用  

Application of an Improved Dijkstra Algorithm in Multicast Routing Problem

作　　者：张毅[1,2] 张猛[1] 梁艳春[1] 

机构地区：[1]吉林大学计算机科学与技术学院国家教育部符号计算与知识工程重点实验室,长春130012 [2]吉林工商学院计算机系,长春130062

出　　处：《计算机科学》2009年第8期205-207,233,共4页Computer Science

基　　金：高等学校博士学科点专项科研基金(批准号:20030183060);吉林省教育厅科研项目(批准号:2007248;2007251;2008411)资助

摘　　要：Dijkstra算法是目前公认的较好的最短路径算法。由于多点路由问题最终归结为最短路径问题,因此将算法改进后应用于多点路由问题。提出的改进主要有以下3点:(1)改变选路策略,基于蚁群算法实现Dijkstra算法的选路操作,使选路更加灵活。(2)结合网络模型的特点,减少了对两顶点之间最短路径以外的大量顶点的计算,提高了算法的速度。(3)考虑到网络路由问题中的阻塞问题,对阻塞顶点进行标识,防止算法选择无用顶点。模拟实验结果表明改进算法较之Dijkstra算法在运算速度上有明显提高。Three improvements on Dijkstra algorithm were presented. The improvements were given as follows： （1）A novel optimized base on ACO implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional Dijkstra algorithm. （2） Based on the model of network routing, in order to reduce the counting of other points, the set of candidates is limited to the nearest c points. （3）Marking the flags on the blocked points in order to prevent selecting these points. By this way simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.

关 键 词：DIJKSTRA算法 蚁群算法 多点路由问题 选路策略 并行策略 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]