DocumentCode
3048986
Title
A more efficient link-state routing algorithm for telecommunication networks
Author
Yanwei, Song ; Guangzhou, Zeng ; Jian, Lian ; Fan, MingQu
Author_Institution
Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China
Volume
2
fYear
2011
fDate
9-11 Dec. 2011
Firstpage
383
Lastpage
386
Abstract
An efficient K-shortest paths routing algorithm for computer networks is presented. The Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF, which is only focusing on finding the shortest path route by Dijkstra algorithm. The desire effect to achieve is mainly through the use of K-shortest paths algorithm, which has been implemented successfully in some fields like traffic engineering. The correctness of this Algorithm is discussed as long as the comparison with OSPF.
Keywords
computer networks; telecommunication network routing; telecommunication traffic; Dijkstra algorithm; K-shortest paths routing algorithm; OSPF; computer networks; link-state routing algorithm; shortest path route; telecommunication networks; traffic engineering; Algorithm design and analysis; Approximation algorithms; Computer networks; Databases; Educational institutions; Quality of service; Routing; K-shortest paths; OSPF; routing algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
IT in Medicine and Education (ITME), 2011 International Symposium on
Conference_Location
Cuangzhou
Print_ISBN
978-1-61284-701-6
Type
conf
DOI
10.1109/ITiME.2011.6132130
Filename
6132130
Link To Document