An Efficient K-shortest Paths based Routing Algorithm

摘要：

　　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.

关键词： K-shortest paths routing algorithm OSPF

作者: JIAN LIAN YAN ZHANG CHENGJIANG LI

作者单位: Shenglizhuang Road no.17, jinan, shandong province, China

会议类型: 国际会议

会议名称: 2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

会议地点: 西安

会议语种:英文

页码: 1775-1779

在线出版日期: 2012-08-24（万方平台首次上网日期，不代表论文的发表时间）