最短路径算法在计算机网络路由选择中的应用研究  

Application of shortest path algorithm in computer network routing

作　　者：邹佰翰 张吉懿 苑晓兵 ZOU Baihan;ZHANG Jiyi;YUAN Xiaobing(College of Computer Science and Technology,Tiangong University,Tianjin 300387,China;School of Intelligent Engineering,Zhengzhou University of Aeronautics,Zhengzhou 450046,China)

机构地区：[1]天津工业大学计算机科学与技术学院,天津300387 [2]郑州航空工业管理学院智能工程学院,河南郑州450046

出　　处：《电声技术》2020年第2期59-60,70,共3页Audio Engineering

摘　　要：计算机网络是现代计算机通信技术中的重要组成部分。在网络层,主机与主机之间的通信经常需要通过路由器转发。高效的路由选择算法通常用最短路径算法实现,典型的最短路径算法有Dijkstra算法、Bellman-Ford算法等。本文针对这两种经典的最短路径算法在计算机网络中的实际应用做研究,并对不同算法的性能和效率做出了必要的评价。Computer network is an important part of modern computer communication technology.At the network layer,host-to-host communications often need to be forwarded through routers.Efficient routing algorithms are usually implemented using the shortest path algorithm.Typical shortest path algorithms include Dijkstra algorithm,Bellman-Ford algorithm,and so on.This paper studies the practical application of these two classic shortest path algorithms in computer networks,and makes necessary evaluations of the performance and efficiency of different algorithms.

关 键 词：路由选择算法 DIJKSTRA算法 Bellman-Ford算法 

分 类 号：TB54[理学—物理]