校园网多径混合路由算法

针对目前校园网路由算法中最小生成树的计算和最短路径的生成存在速度慢和效率低的问题,提出了一种多径混合路由算法.结合了静态路由算法和动态路由算法的优点,减少了计算最短路径树时的总执行时间,当网络中链路有新的权重变化时,它使用多径信息来创建最短路径树,并且能够根据网络中链路权重变化的位置来决定使用静态路由算法或者是动态路由算法.与现有的迪杰斯特拉(Dijkstra)算法、动态Dijkstra算法和混合最短路径树算法进行了对比实验,结果表明多径混合路由算法降低了最小生成树的计算时间.在校园网中使用多径混合路由算法可以加快了网络路由的收敛,提高了网络的性能.

Algorithm of multi-path hybrid routing in campus network

A kind of high-efficiency multi-path hybrid routing algorithm was presented to address both the calculation of the minimum spanning tree and the generation of the shortest path in campus.The total computation time of shortest path tree was reduced by using the advantages of both static routing algorithm and dynamic routing algorithm.The multi-path information was used to create the shortest path tree when some links had new weights.The decision of using static routing algorithm or dynamic routing algorithm was made by the location of the links that had new weights.Comparisons with other routing algorithms,such as Dijkstra algorithm,Dynamic Dijkstra algorithm,and HSPT algorithm,demonstrate that the multi-path hybrid routing algorithm provides better performance in the calculation of minimum spanning tree as the execution time decreases.Therefore,the convergence time of network routing is accelerated by using the proposed algorithm,which provides better performance for campus network.