Routing decision algorithm based on limit arrangement
Shi La · Jisuanji yingyong yanjiu · 2014
In order to do further research on routing protocol of OSPF,this paper analyzed and introduced the method of limit arrangement in mathematical principle,and designed a new routing decision algorithm. It showed that this algorithm and Dijkstra algorithm were the same in time complexity when the arrangement of routing was under the condition of single strand. Meanwhile it existed that the time complexity was between O( n2) and O( n3),and it could possibly be a good superiority when the time complexity was O( n3) when the arrangement of routing was in the actual network structure. When the network topology changes,the algorithm always has a good convergence,which show the algorithm expands OSPF and has widely application.