Routing Algorithms − A routing algorithm is a procedure that lays down the route or path to transfer data packets from source to the destination. There can be many paths from the source to the destination; routing algorithm mathematically computes the best path, i.e. “least – cost path”. Routing algorithms are broadly classified into adaptive and non-adaptive routing algorithms.
Adaptive Routing Algorithms − Also known as dynamic routing algorithms, they makes routing decisions dynamically depending on the network conditions. It constructs the routing table depending upon the network traffic and topology.
Non-Adaptive Routing Algorithms − Also known as static routing algorithms, they do not change the selected routing decisions for transferring data packets from the source to the destination. They construct a static routing table in advance to determine the path through which packets are to be sent.
Summary of Comparison
|Adaptive Routing Algorithms||Non-Adaptive Routing Algorithms|
|Adaptive routing algorithms make routing decisions dynamically depending on the network conditions.||Non-adaptive routing algorithms do not change the selected routing decisions for transferring data packets from the source to the destination.|
|They use the principle of dynamic routing.||They use the principle of static routing.|
|Here, the routing paths are available in dynamic routing tables that are refreshed based on network traffic and topology.||Here, the routing paths are stored in static routing tables which are constructed based upon the routing information stored in the routers when the network is booted up.|
|The complexity is high.||The complexity is lower.|
|They are more frequently deployed in computer networks since most networks are prone to frequent changes and these algorithms can adjust to the changes.||They are preferred for computer networks which are not susceptible to changes. So, their usage is limited.|
|The categories of adaptive routing algorithms are −||The categories of non-adaptive routing algorithms are −|