RESEARCH ON THE PERFORMENCE OF DYNAMIC ROUTING ALGORITHM

摘要：

On the basis of analyzing static routing algorithm and dynamic routing algorithms, this paper focus on the link state routing of the dynamic routing algorithm, puts forward a more concise routing way in the link state routing. Dijkstra routing algorithm is suitable for calculating the shortest path from one router to other routers, but there are more point-to-point links in the computer network, Floyd routing algorithm is more suitable for calculating the shortest distance between two router, and it is more practical in the computer network.

关键词： Routing algorithm Dijkstra algorithm Flody algorithm

作者: MING-XIN YANG BING-TONG WANG WEN-DONG GUO

作者单位: School of Economics and Management, Hebei University of Science and Technology, Shijiazhuang Hebei 0 Shijiazhuang Posts & Telecommunications Technical College, Shijiazhuang Hebei 050021, China

会议类型: 国际会议

会议名称: 2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

会议地点: 保定

会议语种:英文

页码: 2647-2650

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