Research on the performence of dynamic routing algorithm
| Autor: | Bing-Tong Wang, Wen-Dong Guo, Ming-Xin Yang |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
Routing protocol
Router Dynamic Source Routing Computer science Equal-cost multi-path routing Distributed computing Routing table Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol Adaptive routing Routing Information Protocol Hardware_INTEGRATEDCIRCUITS Computer Science::Networking and Internet Architecture Destination-Sequenced Distance Vector routing Hierarchical routing Zone Routing Protocol Static routing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Path vector protocol Distance-vector routing protocol Routing domain Private Network-to-Network Interface Link-state routing protocol Shortest path problem Multipath routing K shortest path routing Dijkstra's algorithm Algorithm |
| Zdroj: | 2009 International Conference on Machine Learning and Cybernetics. |
| DOI: | 10.1109/icmlc.2009.5212662 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|