Research on the performence of dynamic routing algorithm

Abstract

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.