Prerequisite – Classification of Routing Algorithms
1. Adaptive Routing algorithm :
Adaptive routing algorithm is also called as 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.
Adaptive routing algorithm is of three types –
- Centralized algorithm
- Isolation algorithm
- Distributed algorithm
3. Non-Adaptive Routing algorithm :
Non-adaptive routing algorithm is also called as 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 algorithm in terms of complexity.
Non-adaptive routing algorithm is of two types –
- Random walks
Difference between Adaptive and Non-Adaptive Routing algorithms :
|S.NO||Adaptive Routing algorithm||Non-Adaptive Routing algorithm|
|1.||This algorithm creates a routing table based on network conditions.||Whereas this algorithm creates a static table in order to determine when to send packets and which node.|
|2.||This algorithm is used by dynamic routing.||Whereas this algorithm is used by static routing.|
|3.||In adaptive routing algorithm, the routing decisions are made based on network traffic and topology.||Whereas in a non-adaptive routing algorithm, the routing decisions are not made based on network traffic and topology.|
|4.||Adaptive routing algorithms are more complex as compared to non-adaptive routing algorithms in terms of complexity.||While non-adaptive routing algorithms are simple in terms of complexity.|
|5.||In adaptive routing algorithm, the routing decisions are not static tables.||While in non-adaptive routing algorithm, the routing decisions are static tables.|
|6.||Adaptive routing algorithm is categorized into distributed, centralized and isolation algorithm.||Whereas non-adaptive routing algorithm is categorized into random walks and flooding.|
|7.||Adaptive routing algorithm is more used as compared to non-adaptive.||Whereas non-adaptive routing algorithm is comparatively less used.|
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.