Title :
Research on the performence of dynamic routing algorithm
Author :
Yang, Ming-xin ; Wang, Bing-tong ; Guo, Wen-dong
Author_Institution :
Sch. of Econ. & Manage., Hebei Univ. of Sci. & Technol., Shijiazhuang, China
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.
Keywords :
computer networks; telecommunication network routing; computer network; dynamic routing algorithm; link state routing; point-to-point links; shortest path calculating; static routing algorithm; Computer networks; Conference management; Cybernetics; Data encapsulation; Educational institutions; Heuristic algorithms; Machine learning; Machine learning algorithms; Routing; Technology management; Dijkstra algorithm; Flody algorithm; Routing algorithm;
Conference_Titel :
Machine Learning and Cybernetics, 2009 International Conference on
Conference_Location :
Baoding
Print_ISBN :
978-1-4244-3702-3
Electronic_ISBN :
978-1-4244-3703-0
DOI :
10.1109/ICMLC.2009.5212662
