An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing

  • Published : 2007.12.31


Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.


  1. B. Zhang and H. Mouftah, 'Destination-driven shortest path tree algorithms,' J. High Speed Netw., vol. 15, no. 2, pp. 123-130, 2006
  2. V. King, 'Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs,' in Proc. IEEE Symp. Foundations of Computer Science, 1999, pp. 81-91
  3. P. Narvaez, K. Siu, and H. Tzeng, 'New dynamic algorithms for shortest path tree computation,' IEEE/ACM Trans. Netw., vol. 8, no. 6, pp. 734746, Dec. 2000
  4. T. Carmen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. The MIT Press, 2001, pp. 1062-1069
  5. W. Liu, W. Lou, and Y. Fang, 'An efficient quality of service routing algorithm for delay-sensitive applications,' Computer Netw., vol. 47, no. 1, pp. 87-104, Jan. 2005
  6. S. Zhu and G. Huang, 'A new parallel and distributed shortest path algorithm for hierarchically clustered data networks,' IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 9, pp. 841-855, Sep. 1998
  7. M. Barbehenn and S. Hutchinson, 'Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees,' IEEE Trans. Robot. Autom., vol. 11, no. 2, pp. 198-214, Apr. 1995
  8. E. Nardelli, G. Proietti, and P. Widmayer, 'Swapping a failing edge of a single source shortest paths tree is good and fast,' Algorithmica, vol. 35, pp. 56-74, 2003
  9. B. Fortz and M. Thorup, 'Optimizing OSPF/IS-IS weights in a changing world,' IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 756-767, May 2002
  10. B. Wang and J. Hou, 'An efficient QoS routing algorithm for quorumcast communication,' Computer Netw., vol. 44, no. 1, pp. 43-61, Jan. 2004
  11. R. Bellman, 'On a routing problem,' Quarterly Appl. Math., vol. 16, pp. 87-90, 1958
  12. T. G. Griffin, F. B. Shepherd, and G. Wilfong, 'The stable paths problem and interdomain routing,' IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 232-243, Apr. 2002
  13. E. Dijkstra, 'A note two problems in connection with graphs,' Numerical Math., vol. 1, pp. 269-271, 1959
  14. O. Sharon, 'Dissemination of routing information in broadcast networks: OSPF versus IS-IS,' IEEE Netw., vol. 15, no. 1, pp. 56-65, Jan/Feb 2001
  15. J. May, 'OSPF version 2,' 1994
  16. R. Rastogi, Y. Breitbart, M. Garofalakis, and A. Kumar, 'Optimal configuration of OSPF aggregates,' IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 181-194, Apr. 2003
  17. A. Shaikh, R. Dube, and A. Varma, 'Avoiding instability during graceful shutdown of OSPF,' in Proc. IEEE Twenty-First Annual Joint Conf. the IEEE Computer and Commun. Soc., 2002, pp. 883-892
  18. M. Gouda and M. Schneider, 'Maximizable routing metrics,' IEEE/ACM Trans. Netw., vol. 11, no. 4, pp. 663-675, Aug. 2003
  19. S. Nelakuditi, Z. Zhang, and D. Du, 'On selection of candidate paths for proportional routing,' Computer Netw., vol. 44, pp. 79-102, 2004
  20. J. Li, G. Mohan, E. C. Tien, and K. C. Chua, 'Dynamic routing with inaccurate link state information in integrated IP-over- WDM networks,' Computer Netw., vol. 46, no. 6, pp. 829-851, Dec. 2004
  21. S. Gupta and P. Srimani, 'Adaptive core selection and migration method for multicast routing in mobile ad hoc networks,' IEEE Trans. Parallel Distri. Syst., vol. 14, no. 1, pp. 27-38, Jan. 2003
  22. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, 'Fully dynamic output bounded single source shortest path problem,' in Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 212-221
  23. B. Xiao, J. Cao, Q. Zhuge, Z. Shao, and E. Sha, 'Shortest path tree update for multiple link state decrements,' in Proc. IEEE GBOLECOM, 2004, pp. 1163-1167
  24. P. Narvaez, K. Siu, and H. Tzeng, 'New dynamic SPT algorithm based on a ball-and-string model,' IEEE/ACM Trans. Netw., vol. 9, no. 6, pp. 706-718, Dec. 2001