# Difference between Adaptive and Non-Adaptive Routing algorithms

Last Updated : 08 May, 2023

Prerequisite – Classification of Routing Algorithms

1. Adaptive Routing algorithm:
Adaptive routing algorithm is also called a dynamic routing algorithm. In this algorithm, the routing decisions are made based on network traffic and topology. The parameters which are used in adaptive routing algorithms are distance, hop, estimated transit time and count.

The adaptive routing algorithm is of three types –

• Centralized algorithm
• Isolation algorithm
• Distributed algorithm

2. Non-Adaptive Routing algorithm:
Non-adaptive routing algorithm is also called a static routing algorithm. In a non-adaptive routing algorithm, the routing decisions are not made based on network traffic and topology. This algorithm is used by static routing. Non-adaptive routing algorithms are simple as compared to Adaptive routing algorithms in terms of complexity.

The non-adaptive routing algorithm is of two types –

• Flooding
• Random walks

Difference between Adaptive and Non-Adaptive Routing algorithms :

1. Dynamic: Adaptive routing algorithms can adjust to changing network conditions, such as traffic congestion, link failures, and topology changes, by selecting a better path for the data packets. This results in better network performance, higher throughput, and reduced latency.
2. Load Balancing: Adaptive routing algorithms can distribute network traffic across multiple paths to avoid congestion and ensure that all network links are utilized efficiently.
3. Fault Tolerance: Adaptive routing algorithms can reroute data packets around network failures, which enhances network availability and reliability.
4. Better Performance: Adaptive routing algorithms can provide better network performance by selecting the shortest or the least congested path for the data packets.

1. Complexity: Adaptive routing algorithms are more complex than non-adaptive algorithms, which makes them harder to implement and maintain.
2. Overhead: Adaptive routing algorithms require more processing power and memory to execute, which can lead to increased overhead and resource utilization.
3. Routing Loops: Adaptive routing algorithms may sometimes result in routing loops, which can cause data packets to be stuck in the network indefinitely.
4. Delay: Adaptive routing algorithms may introduce additional delay in the network due to the time required to calculate the best path for each data packet.

1. Simplicity: Non-adaptive routing algorithms are simple to implement and maintain, which reduces the cost and complexity of the network infrastructure.
2. Low Overhead: Non-adaptive routing algorithms require minimal processing power and memory to execute, which reduces the overhead and resource utilization.
3. Avoid Routing Loops: Non-adaptive routing algorithms are less likely to result in routing loops, which reduces the chances of data packets being stuck in the network indefinitely.
4. Fast: Non-adaptive routing algorithms can provide faster routing decisions since they do not require the calculation of the best path for each data packet.