JOURNAL ARTICLE
An Efficient K-Shortest Paths Based Routing Algorithm
Jian LianYan ZhangCheng Jiang Li
Year: 2012 Journal: Advanced materials research Vol: 532-533 Pages: 1775-1779 Publisher: Trans Tech Publications
Abstract
We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.
Keywords:
Open Shortest Path First K shortest path routing Dijkstra's algorithm Shortest Path Faster Algorithm Shortest path problem Constrained Shortest Path First Link-state routing protocol Private Network-to-Network Interface Computer science Correctness Algorithm Yen's algorithm Suurballe's algorithm Floyd–Warshall algorithm Distance-vector routing protocol Routing (electronic design automation) Equal-cost multi-path routing Routing protocol Theoretical computer science Computer network
Metrics
2
Cited By
0.38
FWCI (Field Weighted Citation Impact)
7
Refs
0.66
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Network Traffic and Congestion Control
Physical Sciences → Computer Science → Computer Networks and Communications
Advanced Optical Network Technologies
Physical Sciences → Engineering → Electrical and Electronic Engineering
Network Packet Processing and Optimization
Physical Sciences → Computer Science → Hardware and Architecture
Related Documents
JOURNAL ARTICLE
An efficient algorithm for K shortest simple paths
Naoki KatohToshihide IbarakiHisashi Mine
Journal: Networks Year: 1982 Vol: 12 (4)Pages: 411-427
JOURNAL ARTICLE
An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube
Year: 2008 Pages: 43-47
BOOK-CHAPTER
K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks
Saïd HoceiniAbdelhamid MelloukYacine Amirat
Lecture notes in computer science Year: 2005 Pages: 164-172
JOURNAL ARTICLE
Efficient algorithm for finding k shortest paths based on re-optimization technique
Bi Yu ChenXiaowei ChenHui-Ping ChenWilliam H. K. Lam
Journal: Transportation Research Part E Logistics and Transportation Review Year: 2019 Vol: 133 Pages: 101819-101819
JOURNAL ARTICLE
Widest K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks
Alireza EsfahaniMorteza Analoui
Year: 2008 Vol: 3421 Pages: 1032-1035