Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/793
PIRA download icon_1.1View/Download Full Text
Title: Dynamic update of shortest path tree in OSPF
Authors: Xiao, B 
Cao, J 
Zhuge, Q
Shao, Z 
Sha, EH
Issue Date: 2004
Source: ISPAN 2004 : 7th International Symposium on Parallel Architectures, Algorithms and Networks : May 10-12, 2004, Hong Kong, SAR, China : proceedings, p. 18-23
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.
Keywords: Algorithms
Computational complexity
Computer simulation
Dynamics
Internet
Routers
Topology
Publisher: IEEE Computer Society
ISBN: 0-7695-2135-5
ISSN: 1087-4089
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

Files in This Item:
File Description SizeFormat 
shortest-path_04.pdf203.6 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

71
Last Week
0
Last month
Citations as of May 22, 2022

Downloads

118
Citations as of May 22, 2022

SCOPUSTM   
Citations

9
Last Week
0
Last month
0
Citations as of May 12, 2022

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of May 19, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.