汪晓洁;汤建国;李娟;

• 1:新疆财经大学计算机科学与工程学院

摘要(Abstract)：

有向网络中,最短路径的计算在交通、通信等实际问题中有着重要的应用.通过对现有动态最短路径算法的深入研究,提出一种处理网络拓扑变化的全动态最短路径算法(Increase or Decrease of Edge Weight for Shortest Path Tree,IDEWSPT).该算法利用初始最短路径树(Shortest Path Tree SPT)的信息,建立一个SPT的更新队列,当网络拓扑发生变化时,将更新范围局限在受拓扑变化影响的节点中,从而达到控制冗余更新的目的.算法复杂度分析和仿真结果显示,IDEWSPT算法具更高的时间效率.

关键词(KeyWords)： 最短路径;SPF算法;动态更新路由协议

Abstract:

Keywords:

基金项目(Foundation): 新疆高校科研计划青年教师科研启动基金(XJEDU2014S046);; 新疆财经大学科研基金(11XJ011)

作者(Authors): 汪晓洁;汤建国;李娟;

参考文献(References)：

• [1]Moy J.RFC2328:OSPF Version 2[S].April 1998.
• [2]Oran D.RFC1142:OSI IS-IS Intra-domain Routing Protocol[S].Feb 1990.
• [3]Dijkstra E W.A Note on Two Problems in Connection with Graphs[J].Numerical Math,1959,1(1):269-271.
• [4]Bauer R,Wagner D.Batch Dynamic Single-source Shortest-path Algorithms:An Experimental Study[C].Vahrenhold J ed SEA,2009,51-62.
• [5]Xiao Bin,Qing Zhu-ge.Minimum Dynamic Update for Shortest Path Tree Construction[C].proceeding of the GLOBECOM’01.Nov.2001,126-130.
• [6]Xiao Bin,Cao Jiang-nong,Qing Zhu-ge,et al.Shortest path tree update for multiple link state decrements[C].Proceedings of the IEEE Global Telecommunications Conference,2004,1163-1167.
• [7]周灵,王建新.路径节点驱动的低代价最短路径树算法[J].计算机研究与发展,2011,48(5):721-728.
• [8]林澜,闫春钢,蒋昌俊,等.动态网络最短路径问题的复杂性与近似算法[J].计算机学报,2007,30(4):608-614.
• [9]Yagvalkya Sharma,Subhash Chandra Saini,Manisha Bhandhari.Comparison of Dijkstra Shortest Path Algorithm with Genetic Algorithm for Static and Dynamic Routing Network[J].International Journal of Electronics and Computer Science Engineering,2012,1(2):416-425.
• [10]梁德恒,姚国祥,官全龙.基于路由最短路径树的动态多节点删除算法[J].计算机工程,2011,37(5):121-123.
• [11]Hong Qu,Zhang Yi,Simon X.Yang.Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Nerworks[J].Cybernetics,IEEE Transactions on.2013,43(3):995-1010.
• [12]Xiao Bin,Cao Jiang-nong,Shao Z,et al.An efficient Algorithm for Dynamic Shortest Path Tree Update in Networking Routing[J].Journal of Communication and Networks,2007,9(4):409-510.