摘要
针对已有的OSPF路由选择协议作进一步的研究,分析并运用了数学原理中的禁位排列方法,设计出一种新的路由决策算法。研究表明,路由单链排列状态下,该算法与Dijkstra算法具有相同的时间复杂度;在实际网络结构下,存在算法的时间复杂度处于O(n2)到O(n3)之间或者该算法在时间复杂度是O(n3)时具有良好的优越性。网络拓扑结构改变,该算法具备较好的收敛性,说明该算法拓展了OSPF并能够应用到广泛的领域。
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.
出处
《计算机应用研究》
CSCD
北大核心
2014年第1期257-260,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61100182)
