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.