摘要
关于多点路由问题可以看作是带权无向路径图中求解最小Steiner树,关于Steiner问题的启发式算法也有很多,关于这方面的研究非常具有实际意义,在通信网络的实际应用中,路由计算等方面有着很重要的作用。基于几种启发式算法的优缺点分析,提出了一种以链路共享为基础,将点的信息素强度和成为Steiner点的概率结合起来,将启发式算法和蚁群算法相结合成多点路由算法SLMPH,从而保证最终获得的最小Steiner树在全局范围内最优。在网络模型上的仿真实验显示,在平均情况下,使用SLMPH算法求得的Steiner树代价要优于其他几种启发式算法。这对实际通信路由计算问题有着很实际的意义。
The multicast routing problem can be seen as minimum Steiner tree problem,the heuristic algorithms for Steiner problem are so many,and the research of these algorithms have lots of theoretic and realistic significance.In this paper,a new algorithm SLMPH was be proposed based on shared link,the algorithm combine the heuristic algorithm and ant colony algorithm,in order to get the best minimum Steiner tree in global.The results on random networks model show that almost all cases the cost of SLMPH trees is lower than other heuristic algorithms.It makes a lot of realistic significance in routing calculation.
出处
《武汉理工大学学报》
CAS
CSCD
北大核心
2010年第23期140-144,共5页
Journal of Wuhan University of Technology
