On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm

2007 ◽  
Author(s):  
Nuno M. Garcia ◽  
Przemyslaw Lenkiewicz ◽  
Mario M. Freire ◽  
Paulo P. Monteiro
Keyword(s):  
Modeling And Simulation ◽  
Shortest Path ◽  
Routing Algorithms ◽  
Dijkstra Algorithm ◽  
Shortest Path Routing ◽  
Static Source

An Efficient K-Shortest Paths Based Routing Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1775-1779
Author(s):  
Jian Lian ◽  
Yan Zhang ◽  
Cheng Jiang Li
Keyword(s):  
Computer Networks ◽  
Shortest Path ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Routing Algorithms ◽  
Dijkstra Algorithm ◽  
Link State

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.

Dynamics of distributed shortest-path routing algorithms

1991 ◽  
Vol 21 (4) ◽  
pp. 31-42 ◽  
Author(s):  
William T. Zaumen ◽  
J. J. Garcia-Luna Aceves
Keyword(s):  
Shortest Path ◽  
Routing Algorithms ◽  
Shortest Path Routing
Sign in / Sign up

Export Citation Format

Share Document