Table of Contents
Purpose:
- Determines the best route for packet transmission from source to destination.
- Chooses the least-cost path using a routing protocol.
- Routing is about forwarding, and the algorithm chooses the best path.
Classification of Routing Algorithms:
- Adaptive Routing Algorithm (Dynamic)
- Non-Adaptive Routing Algorithm (Static)
1. Adaptive Routing Algorithm
Also called Dynamic Routing.
- Makes decisions based on network topology and traffic conditions.
- Considers metrics like hop count, distance, and transit time.
Types:
- Centralized Algorithm:
- Has global knowledge.
- Uses link-state algorithms.
- Isolation Algorithm:
- Uses only local information.
- Distributed Algorithm:
- No node has full network knowledge.
- Uses Distance Vector Algorithm.
- Calculates routes iteratively and decentrally.
2. Non-Adaptive Routing Algorithm
- Also called Static Routing.
- Routing information is set at network boot time.
- Does not adapt based on traffic or topology.
Types:
- Flooding:
- Sends packets to all outgoing links (except the incoming one).
- May lead to duplicate packets.
- Random Walks:
- Packets are sent to a random neighbor.
- Efficient for alternative path usage.
| Basis | Adaptive Routing | Non-Adaptive Routing |
|---|---|---|
| Definition | Builds table based on network conditions | Builds a static routing table |
| Usage | Used in dynamic routing | Used in static routing |
| Routing Decision | Based on topology & traffic | Based on predefined static table |
| Types | Centralized, Isolation, Distributed | Flooding, Random Walks |
| Complexity | More complex | Simpler |
