A more efficient link-state routing algorithm for telecommunication networks
Song Yanwei, Zeng Guangzhou, Lian Jian, MingQu Fan · 2011
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.