Skip to main content
Article thumbnail
Location of Repository

Dynamic Update of Shortest Path Tree in OSPF

By Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Zili Shao and Edwin H. -m. Sha

Abstract

The Shortest Path Tree (SPT) construction is a critical issue to the high performance routing in an interior network using link state protocols, such as Open Shortest Path First (OSPF) and IS-IS. In this paper, we propose a new efficient algorithm for dynamic SPT update to avoid the disadvantages (e.g. redundant computation) caused by static SPT update algorithms. The new algorithm is based on the understanding of the update procedure to reduce redundancy. Only significantly elements that contribute to the construction of new SPT from the old one will be focused on. The efficiency of our algorithm is improved because it only pay attention to the edges really count for the update process. The running time for the proposed algorithm is maximum reduced, which is shown through experimental results. Furthermore, our algorithm can be easily generalized to solve the SPT updating problem in a graph with negative weight edges and applied to the scenario of multiple edge weight changes.

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.412.202
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.utdallas.edu/~edsha... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.