Please use this identifier to cite or link to this item:
|Title:||Dynamic update of shortest path tree in OSPF|
|Authors:||Xiao, B |
|Publisher:||IEEE Computer Society|
|Source:||ISPAN 2004 : 7th International Symposium on Parallel Architectures, Algorithms and Networks : May 10-12, 2004, Hong Kong, SAR, China : proceedings, p. 18-23 How to cite?|
|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.|
|Rights:||© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Jun 4, 2016
Checked on Jul 24, 2016
Checked on Jul 24, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.