Differences b/w Adaptive and Non-Adaptive Routing Algorithm
Routing algorithm
Routing Algorithm is a mathematical procedure that a dynamic router uses to calculate entries for its routing table.
Classification of a Routing algorithm
The Routing algorithm is divided into two categories:
- Adaptive Routing algorithm
- Non-adaptive Routing algorithm
Differences b/w Adaptive and Non-Adaptive Routing Algorithm
Basis Of Comparison | Adaptive Routing algorithm | Non-Adaptive Routing algorithm |
---|---|---|
Define | Adaptive Routing algorithm is an algorithm that constructs the routing table based on the network conditions. | The Non-Adaptive Routing algorithm is an algorithm that constructs the static table to determine which node to send the packet. |
Usage | Adaptive routing algorithm is used by dynamic routing. | The Non-Adaptive Routing algorithm is used by static routing. |
Routing decision | Routing decisions are made based on topology and network traffic. | Routing decisions are the static tables. |
Categorization | The types of adaptive routing algorithm, are Centralized, isolation and distributed algorithm. | The types of Non Adaptive routing algorithm are flooding and random walks. |
Complexity | Adaptive Routing algorithms are more complex. | Non-Adaptive Routing algorithms are simple. |
Recommended posts:-
- Cyber law or IT law
- IEEE 802.11
- Data broadcasting
- MAC issues
- BluetoothTechnology
- Routing and various Routing algorithm
- wireless LAN
- Mobile agents in mobile computing
- TCP over wireless
- Issuse in Mobile computing
- Handoff or Handover
- Wireless Telephony:object,feature and application
- Application of wireless communication
1 comments:
Click here for commentsBahut bahut thanks
If you have any doubts. Please let me know ConversionConversion EmoticonEmoticon