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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of communications and networks Jg. 9; H. 4; S. 499 - 510
Hauptverfasser:	Bin Xiao, Jiannong Cao, Zili Shao, Sha, Edwin H.-M
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	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)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!