An efficient algorithm for dynamic shortest path tree update in network routing

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 e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of communications and networks Ročník 9; číslo 4; s. 499 - 510
Hlavní autoři: Bin Xiao, Jiannong Cao, Zili Shao, Sha, Edwin H.-M
Médium: Journal Article
Jazyk:angličtina
Vydáno: Séoul Editorial Department of Journal of Communications and Networks 01.12.2007
Korean Institute of Communication Sciences
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithm design and analysis
Algorithms
Analytical models
Applied sciences
Binary trees
Computational modeling
Dynamic update
Exact sciences and technology
Graph theory
Heuristic algorithms
network routing
Network topology
open shortest path first (OSPF)
Routing
Routing (telecommunications)
shortest path tree (SPT)
Shortest-path problems
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Teletraffic
Valuation and optimization of characteristics. Simulation
High performance
Redundancy
Shortest path
Teletraffic
Updating
Tree structure
Algorithm
Dynamic update
OSPF protocol
open shortest path first (OSPF)
Algorithm performance
Computer network
Queueing system
shortest path tree (SPT)
Traffic management
Network routing
Traffic control
ISSN:1229-2370, 1976-5541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1229-2370
1976-5541
DOI:10.1109/JCN.2007.6182886