Introduction to Dynamic Routing

Introduction to Routing

Routing is the process of deciding on an acceptable path to send packets across networks. Routings are calculated by Routers and Routing tables, which include network availability data with its providing path.

There are a couple of routes:

Static Routing

Dynamic Routing

Dynamic routing will be covered in detail in this article.

What is Dynamic Routing?

Dynamic routing: A method of computing routes to destination networks by using routers that learn, advertise, and accumulate route information on the basis of routing protocols. Unlike static routing, dynamic routing does not need to be manually injected into the routing table.

Routers using dynamic routing protocols share their individual routing information with other routers that are directly attached to them, and use the following factors to dynamically modify routes:

Network topology changes

Link failures

Bandwidth

Delay

Hop count

This means that dynamic routing is good for medium to large networks.

Why Dynamic Routing Is Needed

Considering the possible requirement in designing state-of-the-art networks, manual route setup is an arduous task because:

A large number of routers

Frequent topology changes

Link failures

Scalability requirements

Dynamic routing eliminates these issues by:

Automatically discovering new networks

Selecting the best available path

Re-routing of traffic upon link failure

Reducing administrative overhead

How Dynamic Routing Works

Dynamic routing is enabled via routing protocols. The basic working process is:

Neighbor Discovery

The same routing protocol routers are in neighboring connection relations.

Route Advertisement

Gateways exchange information over the networks they know.

Metric Calculation

Each routing protocol has its own metric (number of hops, bandwidth, delay) to determine the best way.

Routing Table Update

The router chooses the route with the least cost and updates its routing table.

Convergence

A network is considered to have converged when all routers contain the same routing information.

Key Terms in Dynamic Routing

Routing Protocol

A protocol that routers use to share or exchange routing information (RIP, OSPF, EIGRP, BGP),Enumerator:Metric Routing Decision Process A set of rules that routers follow when determining how traffic is to be forwarded over a network.

Metric

A value for selection of the proper path.

Examples:

Hop count

Bandwidth

Delay

Cost

Administrative Distance (AD)

A measure of the credibility of a source of routing.

Lower AD = more preferred route.

Examples:

Connected: 0

Static: 1

EIGRP: 90

OSPF: 110

RIP: 120

Convergence

The amount of time that all routers take to learn newly updated routes after a change.

Types of Dynamic Routing Protocols

There are three main categories of dynamic routing protocols:

Distance Vector Routing Protocols

Concept

The best path in distance vector protocols is determined by:

Distance (metric like hop count)

Vector (direction to the destination)

On a regular basis, routers exchange all statements in the routing table with their neighbours.

Characteristics

Simple to configure

Periodic updates

Slower convergence

Prone to routing loops

Example: RIP (Routing Information Protocol)

RIP Features

Metric: Hop count

Maximum hops: 15

Update interval: 30 seconds

Uses UDP port 520

RIP Limitations

Not scalable

Slow convergence

Hop count is a poor metric

Loop Prevention Techniques

Split Horizon

Route Poisoning

Poison Reverse

Hold-down Timer

Link-State Routing Protocols

Concept

Link-state protocol maintains the network topology in its entirety. Every router maintains an LSDB and a shortest path is computed based on the SPF (Dijkstra) algorithm.

Routers exchange link-state advertisement (LSAs) not the  entire routing table.

Characteristics

Fast convergence

Highly scalable

More CPU and memory usage

Complex configuration

Example: ABR is used in OSPF (Open Shortest Path First)

OSPF Features

Metric: Cost (based on bandwidth)

Uses IP protocol number 89

Supports hierarchical design using areas

Backbone area: Area 0

OSPF Advantages

Fast convergence

Loop-free routing

Supports VLSM and CIDR

Efficient updates (triggered updates)

Hybrid Routing Protocols

Concept

Hybrid protocols offer a combination of the two:

Distance Vector

Link-State

They employ optimised algorithms to obtain faster convergence and optimal routing.

Example: EIGRP ( Enhanced Interior Gateway Routing Protocol)

EIGRP Features

Cisco's proprietary (now partially open)

Metric: Bandwidth + Delay (by default)

Uses DUAL (Diffusing Update Algorithm)

Very fast convergence

Uses IP protocol number 88

EIGRP Advantages

Low bandwidth usage

Fast and reliable

Supports unequal cost load balancing

Interior vs Exterior Routing Protocols

Interior Gateway Protocols (IGP)

Used within an organization.

Examples:

RIP

OSPF

EIGRP

IS-IS

Exterior Gateway Protocols (EGP)

Used between organizations (Internet).

Example:

BGP (Border Gateway Protocol)

BGP and Dynamic Routing

BGP is a path-vector protocol for the exchange of routing information on the Internet.

BGP Features

Uses TCP port 179

Highly scalable

Policy-based routing

Key between ISPs and large enterprise parties

BGP optimizes for reliability and control, not speed.

Advantages of Dynamic Routing

Automatic route updates

Scales well for large networks

Handles failures efficiently

Reduces manual configuration

Supports load balancing

Disadvantages of Dynamic Routing

More CPU and memory usage

More complex configuration

Requires protocol knowledge

Can introduce routing overhead

eal-World Use Cases

Enterprise networks

ISP backbone networks

Data centers

Cloud environments

Campus networks

And it works to achieve high availability and fault tolerance in practical applications with dynamic routing.

Feature

Static Routing

Dynamic Routing

Configuration

Manual

Automatic

Scalability

Low

High

Convergence

Not applicable

Yes

Maintenance

High

Low

Resource Usage

Low

Moderate to High

Conclusion

Dynamic routing is the bread and butter of today's networks. It helps routers to dynamically react to the network changes, select successful paths , and sustain efficient services in large and complex networks. Learning dynamic routing protocols such as RIP, OSPF, EIGRP, and BGP is very important for any network engineer while working in the real world or when preparing for your CCNA examination.

In teaching, learning real-time network behavior, fault tolerance, and scalability from dynamic routing turns it into a foundational networking topic.

Do visit our channel to know more: SevenMentor

Author:-

Dhammdip Sarkate