Home » Computer Network » Routing Algorithm: Adaptive vs Non-Adaptive Explained

Routing Algorithm: Adaptive vs Non-Adaptive Explained

Last updated:

Support this post with a reaction:

5,296 views

In computer networks, data is transferred from one device to another in the form of packets. When the source and destination devices are connected to different networks, data may need to travel through several intermediate routers before reaching its destination.

To transfer these packets successfully, the network must select a suitable path between the source and destination. This process is known as routing.

Routing plays an important role in the Network Layer of the OSI model. It helps routers determine where packets should be forwarded so that they can reach the correct destination efficiently.

Different routing methods are used depending on network size, traffic conditions, and communication requirements. Routing algorithms are mainly classified into two types: Adaptive Routing Algorithms and Non-Adaptive Routing Algorithms.

What Is a Routing Algorithm?

A Routing Algorithm is a set of rules and procedures used by routers to determine the best available path for transferring data packets from a source device to a destination device.

It helps routers select suitable routes based on factors such as network topology, distance, number of intermediate routers, link cost, delay, and network traffic.

The main purpose of a routing algorithm is to ensure that data packets reach their destination through an efficient and suitable path.

Routing algorithms also help routers create and update routing tables. A routing table contains information about destination networks, available routes, next-hop addresses, and outgoing interfaces.

Example:

Suppose Computer A wants to send data to Computer D. There are two possible paths:

  • Path 1: A → B → D
  • Path 2: A → C → D

A routing algorithm examines the available routing information and helps the router select a suitable path to transfer the packets to Computer D.

If the first path becomes unavailable, an adaptive routing algorithm may select the second path if it is available.

How Does a Routing Algorithm Work?

A routing algorithm works by examining network information and helping routers decide how packets should travel toward their destination.

The working process can be explained through the following steps:

  1. Collecting Network Information: The router collects information about the network, such as connected devices, available links, and neighboring routers.
  2. Identifying the Destination: The router examines the destination IP address of the incoming packet.
  3. Evaluating Available Routes: It checks the available paths using routing information and routing metrics such as hop count, bandwidth, delay, and cost.
  4. Selecting the Best Path: The routing algorithm determines a suitable path based on the selected routing criteria.
  5. Updating the Routing Table: The router stores the required routing information in its routing table.
  6. Forwarding the Packet: The router forwards the packet through the appropriate outgoing interface toward the destination.

In this way, routing algorithms help routers make decisions about packet transmission.

Characteristics of a Good Routing Algorithm

A good routing algorithm should have certain characteristics to provide efficient and reliable communication.

1. Correctness

A routing algorithm should select valid paths and deliver packets toward the correct destination.

It should avoid incorrect routing decisions that may cause packets to be lost or sent to the wrong network.

2. Simplicity

The routing algorithm should be simple to understand, implement, and maintain.

A simple algorithm reduces processing requirements and makes network management easier.

3. Robustness

A routing algorithm should continue working properly even when network conditions change.

For example, if a router or communication link fails, the routing algorithm should help the network handle the failure.

4. Stability

A good routing algorithm should avoid frequent and unnecessary changes in routing decisions.

It should reach a stable routing condition without continuously changing the selected paths.

5. Fairness

A routing algorithm should provide fair opportunities for different users and devices to transmit their data.

It should prevent certain network connections from receiving all the available resources.

6. Optimality

The algorithm should select the most suitable path according to the chosen routing metric.

For example, it may select a path with fewer hops, lower delay, or lower transmission cost.

7. Efficiency

A routing algorithm should use network resources effectively.

It should minimize unnecessary processing, routing overhead, and communication delays while selecting suitable paths.

Types of Routing Algorithms

Routing algorithms are mainly classified into two types:

  1. Adaptive Routing Algorithm
  2. Non-Adaptive Routing Algorithm

These two algorithms differ mainly in how they select routes and respond to changes in network conditions.

1. Adaptive Routing Algorithm

An Adaptive Routing Algorithm is a routing technique in which routers change or update their routing decisions according to the current conditions of the network.

It is also known as Dynamic Routing.

In this method, routers collect information about the network, such as traffic conditions, link failures, congestion, and network topology. Based on this information, they can select new routes whenever required.

If a particular route becomes unavailable or experiences heavy traffic, the routing algorithm can identify another suitable path for packet transmission.

Adaptive routing is useful in large networks where traffic conditions and network connectivity may change frequently.

Working of Adaptive Routing Algorithm

The working process of an Adaptive Routing Algorithm can be explained through the following steps:

  1. Collecting Network Information: Routers collect information about the current network conditions, including available links, traffic load, and neighboring routers.
  2. Monitoring Network Changes: The algorithm monitors changes such as link failures, congestion, and changes in network topology.
  3. Evaluating Available Paths: It examines the available routes and compares them using routing metrics such as hop count, delay, and link cost.
  4. Selecting a New Route: If the existing route is unavailable or no longer suitable, the algorithm selects another available path.
  5. Updating Routing Tables: The router updates its routing table with the latest routing information.
  6. Forwarding Data Packets: Packets are forwarded through the selected route toward their destination.

Thus, adaptive routing allows a network to respond to changing conditions and maintain communication whenever alternative routes are available.

Example of Adaptive Routing Algorithm

Suppose Computer A wants to send data to Computer D. Two possible paths are available:

  • Path 1: A → B → D
  • Path 2: A → C → D

Initially, the router selects Path 1 because it is suitable for communication.

After some time, the communication link between B and D fails or becomes congested.

In this situation, an adaptive routing algorithm detects the network change and selects Path 2 if it is available.

As a result, data packets can continue travelling toward Computer D through the alternative route.

Types of Adaptive Routing Algorithms

Adaptive routing algorithms can be implemented using different approaches.

1. Centralized Adaptive Routing

In centralized adaptive routing, a central controller or routing system collects information about the network and makes routing decisions.

The routing information is distributed to the routers so that they can forward packets through suitable paths.

This approach provides a central view of the network but depends on the availability and reliability of the central controller.

2. Distributed Adaptive Routing

In distributed adaptive routing, individual routers exchange routing information with neighboring routers.

Each router uses the available information to calculate suitable routes and update its routing table.

This approach is commonly used in dynamic routing protocols.

3. Isolated Adaptive Routing

In isolated adaptive routing, each router makes routing decisions using only the information available locally.

It does not depend on receiving complete routing information from all other routers.

For example, a router may select an outgoing path based on the current queue length or local traffic conditions.

Examples of Adaptive Routing Algorithms

Some commonly used adaptive routing algorithms and routing protocols include:

  • Distance Vector Routing: Routers exchange routing information with their neighbors to calculate suitable routes.
  • Link State Routing: Routers share information about network links and calculate shortest paths using the available topology information.
  • RIP (Routing Information Protocol): A distance-vector routing protocol that uses hop count as its routing metric.
  • OSPF (Open Shortest Path First): A link-state routing protocol that calculates routes using the Shortest Path First algorithm.
  • EIGRP (Enhanced Interior Gateway Routing Protocol): An advanced distance-vector routing protocol that uses multiple metrics to select routes.

Advantages of Adaptive Routing Algorithm

  1. Flexible Routing: It can change routes according to current network conditions.
  2. Handles Network Failures: It can select alternative routes when a router or communication link fails.
  3. Reduces Congestion: It can help select alternative paths when existing routes become heavily loaded, depending on the routing algorithm and configuration.
  4. Suitable for Large Networks: It is useful in networks where topology and traffic conditions change frequently.
  5. Improved Network Availability: It can help maintain communication when alternative routes are available.

Disadvantages of Adaptive Routing Algorithm

  1. Complexity: Adaptive routing algorithms are more complex to design and manage.
  2. Higher Overhead: Routers need to exchange routing information and update routing tables regularly or when network changes occur.
  3. Processing Requirements: They require additional processing and memory to maintain routing information.
  4. Convergence Delay: After a network change, routers may need some time to calculate and agree on updated routes.
  5. Unnecessary Route Changes: Poorly configured routing algorithms may frequently change routes and create instability.

2. Non-Adaptive Routing Algorithm

A Non-Adaptive Routing Algorithm is a routing technique in which routes are selected in advance and do not automatically change according to current network conditions.

It is also known as Static Routing.

In this method, routing decisions are made using predefined information about the network topology. The routes are configured manually by a network administrator or determined in advance.

The router uses the predefined routing information to forward packets toward their destination.

Unlike adaptive routing, non-adaptive routing does not continuously monitor network conditions to select new routes automatically.

It is suitable for small networks where the network structure is stable and changes occur less frequently.

Working of Non-Adaptive Routing Algorithm

The working process of a Non-Adaptive Routing Algorithm can be explained through the following steps:

  1. Predefined Route Selection: Routes are selected in advance based on the known network structure.
  2. Configuration of Routing Tables: The selected routes are entered into the routing tables, usually by a network administrator.
  3. Receiving Data Packets: When a router receives a packet, it examines the destination IP address.
  4. Checking the Routing Table: The router checks its routing table to identify the predefined route for the destination.
  5. Packet Forwarding: The router forwards the packet through the configured outgoing interface.
  6. No Automatic Route Adjustment: If network conditions change, the predefined route does not automatically change to select a better path.

Therefore, non-adaptive routing uses fixed routing information to forward packets.

Example of Non-Adaptive Routing Algorithm

Suppose Computer A wants to send data to Computer D. Two possible paths are available:

  • Path 1: A → B → D
  • Path 2: A → C → D

The network administrator configures Path 1 as the fixed route.

All packets are forwarded through Path 1 according to the configured routing information.

Now, suppose the link between B and D fails.

In non-adaptive routing, the router does not automatically select Path 2 based on this failure. The route must be manually changed or another routing mechanism must be configured.

Thus, non-adaptive routing follows predefined paths without automatically adjusting to changing network conditions.

Examples of Non-Adaptive Routing Algorithms

Some common examples of non-adaptive routing strategies include:

1. Fixed Routing

In fixed routing, routes are determined in advance and stored in routing tables.

The router forwards packets using the predefined paths. The routes generally remain unchanged until an administrator or external process updates them.

2. Flooding

In flooding, a router forwards an incoming packet through all outgoing links except the link on which it arrived, subject to duplicate-control and hop-limit mechanisms.

It does not calculate a single best path based on changing traffic conditions. Multiple copies of the packet may travel through different paths.

3. Random Routing

In random routing, a router selects an outgoing link randomly from the available links, usually excluding the incoming link.

The route is not selected by continuously evaluating current network conditions.

Note: Fixed routing is the clearest example of non-adaptive routing. Flooding and random routing are non-adaptive forwarding strategies in the traditional classification of routing methods.

Advantages of Non-Adaptive Routing Algorithm

  1. Simple Implementation: It is easy to configure and manage in small and stable networks.
  2. Low Overhead: It does not require continuous exchange of routing information.
  3. Less Processing: Routers do not need to repeatedly calculate routes based on changing network conditions.
  4. Predictable Routes: Data packets generally follow predefined paths, making routing behavior easier to understand.
  5. Suitable for Small Networks: It works well in networks where the topology does not change frequently.

Disadvantages of Non-Adaptive Routing Algorithm

  1. Lack of Flexibility: It cannot automatically adjust routes when network conditions change.
  2. Failure Handling: If a configured route becomes unavailable, communication may be interrupted until the route is changed.
  3. Manual Configuration: Network administrators may need to update routing information manually.
  4. Poor Response to Congestion: It does not automatically select alternative routes when the existing path becomes congested.
  5. Not Suitable for Frequently Changing Networks: It is less effective in large and dynamic networks where routers and links may frequently change.

Real-Life Example of Adaptive and Non-Adaptive Routing

Consider a company network that connects multiple office branches through routers.

In adaptive routing, routers continuously exchange routing information. If a communication link between two offices fails, the routers can identify an alternative route and update their routing tables.

In non-adaptive routing, the administrator configures fixed routes between the office branches. If one of the configured links fails, the administrator may need to update the routing table manually to restore communication through another route.

This example explains how adaptive routing responds to network changes, whereas non-adaptive routing depends on predefined routes.

Difference Between Adaptive and Non-Adaptive Routing Algorithms

Adaptive and Non-Adaptive Routing Algorithms are two important routing methods used in computer networks. They differ in how routes are selected, updated, and maintained.

BasisAdaptive RoutingNon-Adaptive Routing
MeaningChanges routes according to network conditionsUses predefined routes
Other NameDynamic RoutingStatic Routing
Route SelectionBased on current network informationBased on predefined information
Network ChangesResponds to network changesDoes not automatically respond
Routing TableUpdated dynamicallyGenerally remains unchanged until reconfigured
Congestion HandlingCan select alternative routes based on routing metricsDoes not automatically adjust to congestion
Link FailureCan select an alternative route if availableMay require manual route changes
ComplexityMore complexComparatively simple
OverheadGenerally higherGenerally lower
ConfigurationUses dynamic routing mechanismsOften requires manual configuration
Suitable ForLarge and changing networksSmall and stable networks
ExamplesRIP, OSPF, EIGRPFixed Routing, Flooding, Random Routing

Routing algorithms play an important role in computer networks because they help routers select suitable paths for transferring data packets from a source to a destination.

There are two major types of routing algorithms: Adaptive Routing and Non-Adaptive Routing.

Adaptive Routing is also called Dynamic Routing because it changes routing decisions according to current network conditions. It is useful in large networks where traffic conditions and network topology may change frequently.

Non-Adaptive Routing is also called Static Routing because it uses predefined routes that do not automatically change according to network conditions. It is suitable for small and stable networks.

Therefore, the main difference is that adaptive routing can adjust routes according to network changes, whereas non-adaptive routing follows predefined routes.