Difference Between Adaptive and Non Adaptive Routing Algorithms

Thekey difference在自适应和非自适应路由算法之间that adaptive routing algorithms take routing decisions based on the network topology and traffic while non adaptive routing algorithms take routing decisions by consulting static tables.

计算机网络中有许多节点。路由是将数据包从源节点转发到目标的过程，找到发送数据包的最佳路径很重要。可以使用路由算法找到它。有两种类型的路由算法称为自适应和非自适应路由算法。

CONTENTS

1.Overview and Key Difference
2.What are Adaptive Routing Algorithms
3.What are Non Adaptive Routing Algorithms
4.并排比较 - 表格形式的自适应与非自适应路由算法
5.概括

What are Adaptive Routing Algorithms?

Thedynamic routingor adaptive routing uses adaptive algorithms. These algorithms change the routing decisions based on the topology and the network traffic. The adjacent routers or all routers provide routing information. The main optimization parameters are some hops, distance, and estimated transit time.

有三种类型的自适应路由算法称为集中，孤立和分布。在里面centralized algorithm, the central node gets all information about the networking topology, traffic and about other nodes. Only one node contains all the routing information. If the central node fails, the entire network fails. Inisolation algorithm, the node gets routing information using local information. It does not require information from other nodes. In thedistributed algorithm, the node receives information from the near nodes and finally decides the path to send the packet.

Generally, the adaptive routing algorithms help to prevent packet delivery failures. It also minimises network congestion and increases the network performance. More bandwidth is necessary when using these algorithms because the network state information exchanges among the nodes. More information exchange can result in better routing, but it can increase the overhead.

What are Non Adaptive Routing Algorithms?

The static routing uses non adaptive routing algorithms. When booting up the network, the routing information downloads to the routers. These algorithms do not take routing decisions based on the network topology or traffic.

此外，洪水和随机步行是非自适应算法的两种分类。。在flooding, every incoming packet is sent on all outgoing lines except the line from which it has arrived. One issue is that a node might receive several copies of a particular packet. Inrandom walks, a packet is sent by the node to one of its neighbours randomly. It is an efficient algorithm because it makes excellent use of the alternative routes.

The non adaptive routing algorithms are simple. Hence, they work well for reliable networks with stable loads. However, they can lead to poor performance if the traffic volume or topologies change over time.

自适应和非自适应路由算法有什么区别？

自适应与非Adaptive Algorithms
Adaptive routing algorithms are the algorithms that base its decisions on data which reflects the current traffic conditions.	Non adaptive routing algorithms are the algorithms that consult static tables to determine which node to send the packet.
Usage
Dynamic routing uses adaptive routing algorithms.	静态路由使用非自适应路由算法。
Routing Decisions
在自适应路由算法中，路由决策的基础是网络流量和拓扑	在non adaptive routing algorithms, the basis of routing decisions are static tables.
Categorization
Centralized, isolated and distributed are the types of adaptive routing algorithms.	洪水和随机步行是非自适应路由算法的类型。
Complexity
Adaptive routing algorithms are more complex.	Non adaptive routing algorithms are simple.

概括–自适应与非Adaptive路由算法

There are various algorithms to find the best path for routing. The difference between adaptive and non adaptive routing algorithms is that adaptive routing algorithms take routing decisions based on the network topology and traffic while non adaptive routing algorithms take routing decisions by consulting static tables.

Reference:

1.“计算机网络（CS425）。”CS425: Computer Networks: Lecture 11.Available here

Image Courtesy:

1.’Fish routing scheme’By George Shuklin – Own work,(CC BY-SA 1.0)viaCommons Wikimedia