Understanding Dynamic Routing: Features, Protocols, and Benefits

Definition – Dynamic routing

Dynamic routing is a network technology that allows routers to automatically calculate the best path between two nodes and update their routing tables accordingly. This process helps networks adapt to changes, such as traffic conditions, failures, or new configurations, without requiring manual intervention. Here’s a detailed look at dynamic routing along with an example:

Key Features of Dynamic Routing

1. Automatic Updates: Routers using dynamic routing protocols can exchange information about network topology changes. This information allows them to automatically recalculate routes when a new network is added or if a network goes down.
2. Scalability: Dynamic routing scales well with large networks because it reduces the need for manual configuration and can efficiently handle changes in the network.
3. Adaptability: It allows the network to adapt to changes in real-time by finding new routes if the current path is no longer optimal or available.

Common Dynamic Routing Protocols

Here’s a detailed look at some of the most common dynamic routing protocols:

1. Routing Information Protocol (RIP)

• Type: Distance-vector protocol.
• Metric: Hop count (maximum of 15 hops, with 16 being considered unreachable).
• Operation: RIP routers broadcast their entire routing table to all adjacent routers at fixed intervals (typically every 30 seconds), regardless of network changes.
• Versions: RIP v1 (classful routing), RIP v2 (classless routing, supports subnet masks, multicast).
• Limitations: Slow convergence, susceptible to routing loops, limited scalability due to the maximum hop count.

2. Open Shortest Path First (OSPF)

• Type: Link-state protocol.
• Metric: Cost, based on bandwidth (customizable).
• Operation: OSPF uses the Dijkstra algorithm to construct a shortest path tree. It sends minimal updates only when there are changes in the network topology rather than at regular intervals.
• Areas: Implements a hierarchical system with areas to optimize routing and reduce overhead.
• Scalability: Highly scalable due to its use of areas, which limit the scope of updates to within the area.

3. Enhanced Interior Gateway Routing Protocol (EIGRP)

• Type: Advanced distance-vector protocol, sometimes described as a hybrid routing protocol.
• Metric: Composite based on bandwidth, delay, load, and reliability (configurable).
• Operation: EIGRP sends incremental updates only when there are changes. It maintains a topology table of learned routes and uses the DUAL algorithm to select efficient, loop-free paths.
• Efficiency: Quickly reconverges and uses less bandwidth than RIP.
• Compatibility: Originally Cisco proprietary, partial information about the protocol has been made available to the public to create interoperable implementations.

4. Border Gateway Protocol (BGP)

• Type: Path-vector protocol.
• Metric: Uses attributes such as AS_PATH, NEXT_HOP, and LOCAL_PREF to determine the best route.
• Operation: BGP is used for routing between autonomous systems on the internet (external BGP) and can also be used within an autonomous system (internal BGP).
• Stability: Designed to be robust and stable rather than fast to converge. BGP can take longer to converge following topology changes but maintains a stable routing environment.
• Scalability: Handles large networks (such as the internet) by requiring manual configurations to control route advertisements and selections.

Key Concepts Common to Dynamic Routing Protocols

• Convergence: How quickly the routers in the network adapt to a change.
• Scalability: How well the protocol can handle an increasing number of routers.
• Administrative Distance: A measure used by routers to select the preferred routing source when two different protocols provide route information for the same destination.
• Metric Calculation: Different protocols use different metrics to calculate the best path, which can include hop count, link cost, bandwidth, delay, and even reliability.

Each protocol is suited to different network needs. RIP is simple and thus suited for smaller networks. OSPF and EIGRP are better for larger organizations with complex network topologies due to their efficiency and scalability. BGP is essential for internet routing, managing the paths data takes across different service providers.

Example of Dynamic Routing

Consider a network with three routers (A, B, and C) connecting various subnets. Here’s how dynamic routing might work with OSPF:

1. Initial Setup: Each router sends out “hello” packets to establish neighbour relationships with directly connected routers.
2. Exchange of Routing Information: Once the neighbours are established, routers exchange their link states (information about their directly connected links and networks). This information is stored in a database that maintains the network topology.
3. Calculation of Routes: Each router uses the Dijkstra algorithm to calculate the shortest path tree for reaching all subnets in the network. This calculation is based on the cost of the paths, which could be determined by bandwidth, delay, or other metrics.
4. Adapting to Changes: Suppose a direct link between Router A and Router C fails. Both routers detect the failure and send out updates. Router B, which is connected to both A and C, recalculates the routes. If B was routing traffic from A to C through the direct link, it now recalculates the route possibly to route through itself, thus ensuring that the network remains operational.
5. Updating Routing Tables: Each router updates its routing table based on the new calculations, directing data along the optimal paths given the current state of the network.

This dynamic process allows networks to maintain reliable communications even in the face of constant changes and is fundamental to the operation of complex networks, especially those of ISPs and large enterprise systems.

Useful Links

https://www.cisco.com/c/en/us/support/switches/nexus-3000-series-switches/products-installation-and-configuration-guides-list.html

https://sanchitgurukul.com/tutorials-cat