VMware ESXi and vSphere Cluster Management

Dynamic Routes and Dynamic Routing Protocols

Learn how dynamic routing protocols exchange reachability information, select best paths, update routing tables, and reroute traffic after link failures.

Dynamic routing allows routers to learn and maintain routes automatically. Instead of entering an individual route for every remote network, an administrator enables a dynamic routing protocol on participating routers. The routers then exchange reachability information, evaluate available paths, and install the best routes in their routing tables.

This lesson assumes that you understand router interfaces, IPv4 addressing and CIDR prefixes, directly connected networks, routing tables, next-hop forwarding, and static routes.

What Is a Dynamic Route?

A dynamic route is a route learned and maintained through a dynamic routing protocol. The route is not entered individually by an administrator as a static route. Instead, routers discover the route by exchanging routing information.

A dynamic routing protocol is the mechanism routers use to exchange network reachability and path information. It can advertise networks, learn routes, compare candidate paths, detect changes, and maintain routing information.

The route and the protocol are related but are not the same thing:

The route describes how to reach a destination network, including a next hop or outgoing interface.
The routing protocol learns, advertises, evaluates, and maintains that route.
The routing table contains the route entries the router currently uses to make forwarding decisions.

A router may learn several routes to the same destination. The routing process evaluates those candidates using its selection rules and metric. The selected best route is then installed in the routing table. A nonpreferred route may remain known to the routing process as an alternative, depending on the protocol and platform.

Important Routing Terms

Term	Meaning
Dynamic route	A route learned and maintained through a dynamic routing protocol.
Dynamic routing protocol	A protocol that exchanges network reachability and path information between routers.
Routing information	Information about destination networks, paths, reachability, and route preference.
Routing table	The table containing route entries used to determine where packets are forwarded.
Route advertisement	A routing-protocol message that communicates network reachability or path information.
Route withdrawal	An update indicating that a previously reachable route is no longer usable.
Directly connected network	A network attached to one of a router's active interfaces.
Best path	The preferred route selected from multiple available routes to the same destination.
Metric	A value or set of values used to compare candidate paths.
Next hop	The neighboring router or outgoing direction used to reach a destination.
Topology change	A path change, such as a link or interface failure, that can require route updates.
Convergence	The process through which routers update their knowledge and reach a consistent view after a network change.
Static route	A manually configured route, contrasted with a dynamically learned route.

How Dynamic Routing Works

Routers begin with knowledge of their directly connected networks. A directly connected network is attached to an active router interface. The routing protocol enables a router to advertise that network to neighboring routers.

Neighboring routers receive the advertisement and learn that the advertising router can provide a path to the network. They can then advertise that reachability to other routers. In this way, information about remote networks spreads across a multi-router topology.

Enable a selected routing protocol on participating routers.
Configure the appropriate directly connected networks to be advertised.
Routers form neighbor or peer relationships when the protocol requires them.
Routers exchange reachability and path information.
Each router evaluates the available paths using protocol-specific rules and metrics.
The preferred route is installed in the routing table.
Packet forwarding uses the next hop from the installed route.

A route advertisement does not mean that every received route is immediately used. The router first evaluates the route. Only the best available route, or eligible set of equal best routes, is placed into the forwarding information used by the router.

Dynamic Routes and the Routing Table

Routing protocols exchange and process information; the routing table supplies the forwarding decision. These are different functions.

For example, suppose R1 has a selected route to 10.0.0.0/24 with R2 as its next hop. When R1 receives a packet for an address in that prefix, it looks up the destination in its routing table and forwards the packet to R2. The routing protocol is not forwarding each packet. It is maintaining the information that makes the forwarding decision possible.

If the selected path fails, the routing protocol updates its knowledge. After the routing table changes, R1 forwards new packets using the newly selected next hop.

Why Use Dynamic Routing?

Less Manual Route Administration

With static routing, an administrator must configure routes to remote networks manually. As the network grows, every relevant router may need new entries whenever a network or path changes.

Dynamic routing reduces this repetitive work. Routers learn remote networks from one another rather than requiring an administrator to enter every remote route on every router.

Automatic Learning Across Multiple Routers

In a multi-router network, one router can advertise a directly connected network, another router can learn that advertisement, and additional routers can learn paths through the second router. This allows route information to propagate throughout the routing domain.

Adaptation to Topology Changes

A topology change occurs when the available network paths change. Examples include an interface failure, a disconnected cable, or a router becoming unreachable. Dynamic protocols can detect or advertise the loss of a path, recalculate routes, and select an alternate path when one exists.

Routers need time to exchange updates and recalculate their paths. The period during which routers are updating their knowledge is part of convergence. During convergence, different routers may temporarily have different views of the network.

Four-Router Failover Example

Consider this topology:

                         10.0.0.0/24
                              |
                              R4
                             /  \
                            /    \
                         R2      R3
                          \      /
                           \    /
                              R1

R1 has two possible paths toward the destination network behind R4:

Primary candidate: R1 → R2 → R4
Alternate candidate: R1 → R3 → R4

R2 and R3 advertise paths toward 10.0.0.0/24 to R1. R1 receives multiple candidates for the same prefix. Based on the routing protocol's metric and selection rules, R1 initially chooses the path through R2.

While the preferred route is installed, traffic for 10.0.0.0/24 is forwarded from R1 to R2, then toward R4.

Failure of the R2-to-R4 Link

Now assume that the link between R2 and R4 fails.

R2 detects that the interface or link toward R4 is unavailable.
R2 updates its routing information and advertises the loss of reachability, or withdraws the failed route.
R1 processes the update and removes or replaces the failed preferred path.
R1 compares the remaining candidates and selects the path through R3.
After routing convergence, R1 forwards traffic along R1 → R3 → R4.

R2 can also learn an alternate path toward 10.0.0.0/24 through R1, R3, and R4 after the routing information is updated. The exact update behavior depends on the routing protocol, but the important concept is that routers can automatically adapt their route choices when the topology changes.

Network State	Available Path from R1	Selected Path	Traffic Forwarding Result
Normal operation	Through R2 or through R3	R1 → R2 → R4	Packets for 10.0.0.0/24 are sent to R2.
R2-R4 link failure	The path through R2 is no longer usable; the path through R3 remains available.	The failed path is removed or replaced, and R3 becomes the candidate path.	Forwarding changes after the routing table is updated.
After routing convergence	R1 has a usable path through R3; R2 may also learn a path through R1 and R3.	R1 → R3 → R4	Traffic resumes through R3 and R4, assuming those links remain operational.

Best-Path Selection

Routers can learn more than one path to the same destination network. A routing protocol compares those paths using a metric and other route-selection rules.

A metric is a value used to represent the relative preference or cost of a path. Different protocols may consider different characteristics, such as hop count, link cost, bandwidth, delay, or a composite value. A lower metric is preferred in some protocols, while other protocols use different comparison rules.

In general, the process is:

Receive route candidates for a destination prefix.
Evaluate each candidate using the protocol's path-selection rules.
Select the best path or equal-cost paths, if equal-cost forwarding is supported.
Install the selected route in the routing table.
Use the selected next hop to forward packets.

Do not assume that the physically shortest path is always selected. The routing protocol's metric and route preference determine the result. Administrative distance or another preference mechanism can also affect which source of routing information wins when multiple protocols provide routes to the same destination.

Static Routing Compared with Dynamic Routing

Characteristic	Static Routing	Dynamic Routing
How routes are learned	Routes are entered manually by an administrator.	Routes are learned through routing-protocol advertisements and calculations.
Administrative effort	Low for a small, stable network; increasingly burdensome as the network grows.	More initial planning, but less manual route entry across a growing network.
Response to link failure	Usually requires a manually configured backup route or administrative action.	Can detect or advertise the failure and select an alternate learned path.
CPU use	Generally low because there is no ongoing protocol calculation.	Uses CPU for neighbor operation, updates, route calculations, and maintenance.
Bandwidth use	Does not use routing-protocol update bandwidth.	Uses bandwidth for updates, protocol messages, and topology information.
Configuration complexity	Simple for small topologies, but difficult to maintain at scale.	More complex to configure, verify, and troubleshoot.
Typical suitability	Small, stable networks, stub networks, or carefully controlled paths.	Medium and large networks that need scalability and resiliency.

Dynamic routing is therefore a scalability and resiliency tradeoff, not an option that is universally better than static routing. A static route may be ideal for a small network or a predictable default path. Dynamic routing is often valuable when many routers, multiple paths, and changing links make manual maintenance impractical.

Costs and Tradeoffs of Dynamic Routing

CPU consumption: Routers spend processing time maintaining neighbors, processing protocol messages, comparing routes, and recalculating paths.
Bandwidth consumption: Routing updates, keepalives, and topology information use network bandwidth. The amount and timing depend on the protocol.
Operational complexity: Dynamic protocols require correct configuration and a methodical verification process. Incorrect settings can prevent neighbors from forming or block route advertisements.
Convergence behavior: A failure is not necessarily repaired instantly. Routers must detect the change, exchange information, recalculate routes, and update forwarding state.

Conceptual Configuration and Verification Workflow

Choose an appropriate routing protocol for the network design.
Enable the protocol on the participating routers.
Advertise the appropriate directly connected networks.
Verify neighbor or peer relationships when the selected protocol uses them.
Inspect the routing table for dynamically learned routes.
Test reachability to remote networks.
Simulate or observe a link failure, then verify route removal, replacement, and forwarding through the alternate path.

The exact configuration syntax is protocol-specific. The following Cisco IOS-style commands are verification examples, not a complete protocol configuration:

show ip route
show ip protocols
show ip ospf neighbor
ping 10.0.0.1

show ip route can display installed routes. show ip protocols can summarize active routing-protocol operation on platforms that support it. show ip ospf neighbor is specific to OSPF and should be used only when OSPF is configured. Complete syntax for enabling and advertising networks belongs in the lesson for the selected protocol.

Troubleshooting Dynamic Routes

A Router Does Not Learn a Remote Network

Confirm that the routing protocol is enabled on the relevant interfaces or networks.
Confirm that the router directly connected to the destination is advertising that network.
Check interface status and Layer 3 reachability between routing neighbors.
Verify that protocol settings match on neighboring routers.
Check whether route filtering, passive-interface settings, or another policy is blocking the advertisement.
Inspect the routing table and protocol status to determine whether the route was never learned, rejected, or lost later.

Traffic Continues Toward a Failed Path or Switches Slowly

Confirm that the failed interface or link is detected as down.
Inspect the routing table for the destination prefix before and after the failure.
Verify that an alternate route exists through another router.
Allow for route recalculation and convergence; forwarding may be affected temporarily while routers update their knowledge.

The Router Selects an Unexpected Path

Compare the protocol metrics for the candidate routes.
Confirm which route is installed in the routing table.
Check whether administrative distance, route preference, or protocol-specific path-selection rules affect the result.
Verify that the apparently preferred path is actually reachable and permitted by routing policy.

Exam-Relevant Distinctions

A dynamic route is learned through a routing protocol; a static route is manually configured.
The routing protocol exchanges and evaluates information, while the routing table is used for packet forwarding.
A directly connected network is the starting point for advertisements from a router.
A route advertisement communicates reachability; a route withdrawal communicates that a previously usable route is no longer available.
A metric helps compare candidate paths, but metric rules differ among protocols.
Convergence is the process of updating routing knowledge after a topology change.
Dynamic routing can reduce manual administration and provide automatic failover, but it consumes CPU and bandwidth and adds configuration complexity.
When a preferred path fails, traffic changes only after the routing process updates the routing table and forwarding state.

Summary

Dynamic routes are automatically learned and maintained by dynamic routing protocols. Routers advertise directly connected networks, exchange reachability information, evaluate multiple paths, and install the best available route in their routing tables.

When a topology change makes a preferred path unusable, routers can advertise the failure or withdraw the route, recalculate their choices, and converge on an alternate path. This automatic adaptation is the main benefit of dynamic routing. The tradeoff is additional CPU processing, protocol bandwidth, configuration complexity, and convergence behavior.

For a related reference, see Dynamic Routes.