Distance vector routing (RIP) in Computer Networks - Deep Dive

Overview - Distance vector routing (RIP)

What is it?

Distance vector routing is a method used by routers to find the best path to send data across a network. RIP, or Routing Information Protocol, is one of the oldest distance vector routing protocols. It works by routers sharing their routing tables with their neighbors regularly, helping each router learn the distance (or cost) to reach different network destinations. This way, routers can decide the shortest path for data to travel.

Why it matters

Without distance vector routing like RIP, routers would not easily know the best paths to send data, leading to slow or failed communication across networks. It solves the problem of dynamically finding routes in changing networks without manual setup. This keeps the internet and local networks running smoothly, allowing devices to communicate efficiently.

Where it fits

Before learning distance vector routing, you should understand basic networking concepts like IP addresses, routers, and how data moves in a network. After mastering RIP, learners can explore more advanced routing protocols like link-state routing (OSPF) and path-vector routing (BGP) for larger and more complex networks.

Mental Model

Core Idea

Each router shares its view of the network distances with neighbors, and by repeating this, all routers learn the shortest paths to every destination.

Think of it like...

Imagine a group of friends in different towns sharing how far they are from various landmarks. Each friend tells their neighbors the distances they know, and over time, everyone learns the shortest way to reach any landmark by combining all the shared information.

Router A ── shares distances ──▶ Router B ── shares distances ──▶ Router C
  ▲                                         │
  │                                         ▼
Router D ◀──────────── shares distances ◀──── Router E

Each arrow represents routers exchanging their distance tables regularly.

Build-Up - 7 Steps

1

Foundation

Basic concept of routing tables

Concept: Routers keep a list called a routing table that tells them where to send data next.

A routing table is like a map inside a router. It lists network destinations and the next step to reach them. For example, if a router wants to send data to a device in another network, it looks up the destination in its table to find the next router to forward the data to.

Result

Routers can forward data correctly based on their routing tables.

Understanding routing tables is essential because distance vector routing is all about how routers build and update these tables.

2

Foundation

What distance vector means

Concept: Distance vector means routers share the distance (cost) to reach networks with neighbors.

In distance vector routing, each router tells its neighbors how far it is from different networks. Distance can be measured in hops (number of routers to cross). Routers use this info to update their own tables, choosing paths with the smallest distance.

Result

Routers gradually learn the shortest paths to all networks by exchanging distance info.

Knowing that routers only share distances with neighbors explains why routing info spreads step-by-step through the network.

3

Intermediate

How RIP updates routing tables

🤔Before reading on: do you think routers send their entire routing table or just changes? Commit to your answer.

Concept: RIP routers send their full routing tables to neighbors every 30 seconds.

RIP works by routers broadcasting their entire routing table to directly connected neighbors regularly, typically every 30 seconds. When a router receives this info, it compares the distances and updates its own table if it finds a shorter path. This process repeats continuously.

Result

Routing tables stay updated with current shortest paths, adapting to network changes.

Understanding that RIP sends full tables regularly explains why it can be slow and bandwidth-heavy compared to newer protocols.

4

Intermediate

Limitations of RIP's hop count

🤔Before reading on: do you think RIP can handle networks larger than 15 hops? Commit to yes or no.

Concept: RIP limits the maximum hop count to 15, treating anything beyond as unreachable.

RIP uses hop count as its metric, but it sets a maximum of 15 hops. If a destination is more than 15 hops away, RIP considers it unreachable. This limits RIP to small or medium-sized networks and prevents routing loops from causing endless counting.

Result

RIP avoids some routing problems but cannot support very large networks.

Knowing RIP's hop limit helps explain why it's not used in large modern networks.

5

Intermediate

Routing loops and split horizon

🤔Before reading on: do you think routers send routing info back to the neighbor they learned it from? Commit to yes or no.

Concept: RIP uses techniques like split horizon to prevent routing loops by not sending info back to the source neighbor.

Routing loops happen when routers keep sending data in circles. RIP uses split horizon, which means a router does not tell a neighbor about routes it learned from that neighbor. This helps stop loops and speeds up convergence (when all routers agree on routes).

Result

Networks avoid endless loops and routing errors.

Understanding split horizon reveals how RIP tries to keep routing stable despite its simple design.

6

Advanced

How RIP handles network changes

🤔Before reading on: do you think RIP instantly knows about a broken link or takes time? Commit to your answer.

Concept: RIP detects changes slowly due to periodic updates and uses timers to avoid false info.

When a link breaks, RIP routers only learn about it after missing updates for a while (180 seconds). They then mark routes as unreachable and inform neighbors. This slow reaction can cause temporary routing loops or delays in finding new paths.

Result

RIP networks can experience slow recovery from failures.

Knowing RIP's slow convergence explains why newer protocols improve on this for better network reliability.

7

Expert

RIP's internal timers and convergence issues

🤔Before reading on: do you think all RIP timers serve the same purpose or have distinct roles? Commit to your answer.

Concept: RIP uses multiple timers (update, invalid, hold-down, flush) to manage routing info and prevent instability.

RIP has four key timers: update timer (sends routing info every 30s), invalid timer (marks routes invalid after 180s without updates), hold-down timer (prevents accepting bad routes temporarily), and flush timer (removes routes after 240s). These timers balance info freshness and stability but can cause slow convergence and temporary routing loops.

Result

RIP maintains routing tables with some delay and protection against flapping routes.

Understanding these timers reveals why RIP is simple but limited, and how timing affects network behavior.

Under the Hood

RIP routers maintain routing tables with destination networks and hop counts. Every 30 seconds, each router broadcasts its entire table to neighbors. Upon receiving a neighbor's table, the router updates its own entries if a shorter path is found by adding one hop to the neighbor's distance. Timers track route validity and control when routes are removed or suppressed to avoid loops. This process repeats continuously, allowing routers to gradually learn the network topology.

Why designed this way?

RIP was designed in the early days of networking when simplicity and ease of implementation were priorities. Using hop count as a metric and periodic full-table broadcasts made it easy to implement on limited hardware. The hop limit and timers were added to prevent routing loops and instability, trading off speed and scalability. Alternatives like link-state routing were more complex and resource-intensive at the time.

┌─────────────┐       ┌─────────────┐       ┌─────────────┐
│  Router A   │──────▶│  Router B   │──────▶│  Router C   │
│ Routing Tbl │       │ Routing Tbl │       │ Routing Tbl │
│ Dest: Net1  │       │ Dest: Net1  │       │ Dest: Net1  │
│ Hops: 1     │       │ Hops: 2     │       │ Hops: 3     │
└─────────────┘       └─────────────┘       └─────────────┘
       ▲                    │                    │
       │                    ▼                    ▼
┌─────────────┐       ┌─────────────┐       ┌─────────────┐
│  Router D   │◀──────│  Router E   │◀──────│  Router F   │
│ Routing Tbl │       │ Routing Tbl │       │ Routing Tbl │
└─────────────┘       └─────────────┘       └─────────────┘

Routers exchange full tables periodically, update hop counts by adding 1, and use timers to manage route validity.

Myth Busters - 4 Common Misconceptions

Quick: Does RIP instantly detect a broken link and update all routers immediately? Commit to yes or no.

Common Belief: RIP instantly knows when a link fails and immediately updates all routers.

Reality: RIP detects failures only after missing several periodic updates (up to 180 seconds), causing slow convergence.

Why it matters: Believing in instant updates leads to overestimating RIP's reliability and can cause network downtime during failures.

Quick: Does RIP use metrics like bandwidth or delay to choose routes? Commit to yes or no.

Common Belief: RIP chooses routes based on factors like bandwidth, delay, or reliability.

Reality: RIP uses only hop count as its metric, ignoring other factors.

Why it matters: Assuming advanced metrics can cause confusion when RIP selects suboptimal paths in real networks.

Quick: Can RIP support networks with more than 15 hops? Commit to yes or no.

Common Belief: RIP can handle any network size regardless of hop count.

Reality: RIP limits routes to a maximum of 15 hops; beyond that, destinations are unreachable.

Why it matters: Ignoring this limit can cause network design failures and unreachable destinations.

Quick: Does RIP send only changed routes to neighbors? Commit to yes or no.

Common Belief: RIP sends only updates about changed routes to neighbors to save bandwidth.

Reality: RIP sends the entire routing table to neighbors every 30 seconds.

Why it matters: Misunderstanding this leads to underestimating RIP's bandwidth use and potential network load.

Expert Zone

1

RIP's simplicity makes it vulnerable to slow convergence and routing loops despite mechanisms like split horizon and hold-down timers.

2

The choice of 15 hops as a maximum was a practical tradeoff to limit routing loops but restricts network size.

3

RIP's periodic full-table broadcasts can cause unnecessary network traffic, which modern protocols avoid with triggered updates.

When NOT to use

RIP is unsuitable for large or complex networks due to its hop limit and slow convergence. Instead, use link-state protocols like OSPF or path-vector protocols like BGP for scalability and faster reaction to changes.

Production Patterns

In real networks, RIP is mostly used in small or legacy environments. Network engineers often combine RIP with other protocols or use it in isolated segments. Understanding RIP helps troubleshoot older systems and grasp routing fundamentals before moving to advanced protocols.

Connections

Link-state routing (OSPF)

Builds on and improves distance vector by sharing full network topology instead of just distances.

Knowing RIP helps understand why OSPF was developed to solve slow convergence and scalability issues by having routers know the entire network map.

Bellman-Ford algorithm

Distance vector routing algorithms like RIP implement the Bellman-Ford algorithm to find shortest paths.

Understanding the Bellman-Ford algorithm explains how routers iteratively update distances and detect unreachable routes.

Social network information spread

Similar pattern where information spreads step-by-step through neighbors until everyone is informed.

Recognizing this pattern in social networks helps grasp how routing info propagates gradually in distance vector protocols.

Common Pitfalls

#1 Assuming RIP updates routes instantly after a link failure.

Wrong approach:

Expecting immediate route change and not accounting for 180-second invalid timer delay.

Correct approach:

Designing network monitoring and failover with RIP's slow convergence in mind, allowing time for updates.

Root cause:

Misunderstanding RIP's periodic update and invalid timers causes unrealistic expectations of network behavior.

#2 Using RIP in a large network exceeding 15 hops.

Wrong approach:

Deploying RIP across a network with 20+ hops expecting full connectivity.

Correct approach:

Choosing OSPF or BGP for large networks to handle longer paths and complex topologies.

Root cause:

Ignoring RIP's hop count limit leads to unreachable destinations and network failures.

#3 Ignoring routing loops and not configuring split horizon or hold-down timers.

Wrong approach:

Disabling or misconfiguring loop prevention features, causing routing loops.

Correct approach:

Enabling split horizon, route poisoning, and hold-down timers to prevent loops.

Root cause:

Lack of understanding of routing loop causes and RIP's loop prevention mechanisms.

Key Takeaways

Distance vector routing like RIP helps routers find paths by sharing distance info with neighbors regularly.

RIP uses hop count as a simple metric and limits routes to 15 hops, making it suitable only for small networks.

RIP sends full routing tables every 30 seconds, which can cause slow updates and higher network traffic.

Mechanisms like split horizon and timers help prevent routing loops but also slow down network convergence.

Understanding RIP's design and limits is essential before moving to more advanced routing protocols used in modern networks.