# RIP

> Source: Courseiva IT Certification Glossary — https://courseiva.com/glossary/rip

## Quick definition

RIP is a way for routers to talk to each other and decide the best path for data to travel across a network. It counts the number of routers a message must pass through, called hops, and picks the route with the fewest hops. While it is simple and easy to set up, it is not ideal for large or fast-changing networks because it can be slow to adapt to changes.

## Simple meaning

Imagine you are in a small town with several post offices. Each post office knows how to send a letter to every house, but they only know the number of other post offices the letter must go through to reach its destination. If there are two routes to a house, one going through two post offices and another through three, the post office will always choose the route with only two stops. That is basically how RIP works.

RIP is a routing protocol, which is just a set of rules that routers follow to share information. Every 30 seconds, a router using RIP sends out a message to its neighboring routers, telling them all the destinations it knows about and how many hops away each destination is. The neighbor routers then update their own maps, or routing tables, with this information. Over time, every router learns the shortest path to every network it can reach.

However, RIP has some limitations. It only uses hop count as a measure of distance, which can be misleading. A path with only two hops might go through a very slow connection, while a path with three hops might be much faster. RIP also has a maximum hop count of 15, so any network that is 16 or more hops away is considered unreachable. This makes RIP unsuitable for very large networks like the internet. Despite its age and simplicity, RIP is still used in small networks or as a learning tool because it is easy to understand and configure.

## Technical definition

RIP is a standardized, distance-vector routing protocol originally developed in the 1980s and defined in RFC 1058 for RIPv1 and RFC 2453 for RIPv2. It operates at the network layer (Layer 3) of the OSI model and uses the Bellman-Ford algorithm to compute the best path to a destination based on hop count as its sole metric. Each router maintains a routing table that contains entries for each known destination network, the next-hop router, and the number of hops (the metric) to reach that network.

Routers using RIP send periodic updates every 30 seconds to their directly connected neighbors. These updates contain the entire routing table (in RIPv1) or subsets depending on the implementation. RIPv1 is a classful protocol, meaning it does not include subnet mask information in its updates and therefore cannot support variable-length subnet masking (VLSM) or classless inter-domain routing (CIDR). RIPv2 is a classless version that includes subnet mask information, supports authentication, and uses multicast (224.0.0.9) instead of broadcast for efficiency.

RIP uses several timers to maintain network stability and convergence. The update timer (30 seconds) triggers periodic updates. The invalid timer (180 seconds) sets how long a route can remain in the routing table without an update before being marked as invalid. The hold-down timer (180 seconds) prevents a router from accepting new information about a route for a period after it goes down, which helps prevent routing loops. The flush timer (240 seconds) removes the route entirely from the table.

One of RIP's most well-known limitations is its hop count limit of 15. A route with a hop count of 16 is considered unreachable, which effectively restricts RIP to smaller networks. RIP also has relatively slow convergence compared to more modern protocols like OSPF or EIGRP. The periodic updates can consume bandwidth, especially in large networks. Despite these drawbacks, RIP remains relevant in legacy environments, small office/home office (SOHO) networks, and as a teaching tool for networking fundamentals.

## Real-life example

Think of a college campus with multiple buildings connected by pathways. Each building has a messenger who needs to deliver letters to every other building. The messengers have agreed to a simple rule: they only care about how many buildings a letter passes through, not how long each path takes.

One day, a messenger in the Science building wants to send a letter to the Art building. He knows three possible routes: Science to Library to Art (2 hops), Science to Gym to Dorm to Art (3 hops), or Science directly to Art (1 hop). Since his rule is to pick the route with the fewest buildings, he chooses the direct path. That is exactly what a RIP router does when it looks at the number of routers (hops) between the source and destination.

Now imagine the messengers meet every 30 seconds in the central courtyard to share maps. Each messenger tells the others every building they know how to reach and how many hops away each one is. If the messenger from the Library hears that the Gym knows a way to the Dorm in 1 hop, he updates his own map to show the Dorm as 2 hops away (Library plus Gym). If later the direct path from Science to Art is blocked by construction, the messenger in Science will rely on the next best route, which might be Science to Library to Art (2 hops).

This analogy shows how RIP works through periodic sharing of routing information and hop-based decision making. It also highlights a weakness: the messengers never consider whether a path is slow, like a gravel road, vs. a fast paved path. They only count buildings. Similarly, RIP does not account for bandwidth or delay, which can lead to suboptimal routing choices in real networks.

## Why it matters

RIP matters because it is one of the oldest and simplest routing protocols, making it a fundamental building block for understanding how networks share routing information. For IT professionals, knowing RIP provides a baseline for learning more complex protocols like OSPF, EIGRP, or BGP. Many network certification exams, including CompTIA Network+ and Cisco CCNA, include RIP as a topic, and exam questions often test your understanding of distance-vector concepts, hop count limits, and convergence behavior.

In the real world, RIP is still deployed in small networks where simplicity outweighs performance. For example, a small remote office with 10 routers might use RIP because it is easy to configure and does not require the administrative overhead of a more complex protocol. Legacy systems, such as older routers or networks that have not been upgraded, may also run RIP. Understanding RIP helps in troubleshooting such environments or planning migration to a newer protocol.

RIP's limitations are also valuable lessons. Its 15-hop limit teaches you that network design must account for protocol constraints. Its slow convergence after a link failure illustrates the importance of fast convergence in modern networks. When you study RIP, you learn about routing loops, split horizon, route poisoning, and hold-down timers, concepts that apply to all distance-vector protocols, including the more advanced BGP. Therefore, RIP is not just a historical curiosity but a practical teaching tool and a real-world protocol in specific niches.

## Why it matters in exams

RIP appears in multiple IT certification exams, primarily in the context of networking fundamentals. For CompTIA Network+ (N10-008 or N10-009), RIP is covered under domain 1.0 (Networking Fundamentals). You are expected to understand RIP as a distance-vector routing protocol, its hop count limit of 15, its use of periodic updates (every 30 seconds), and its role in small networks. Questions often ask you to identify RIP characteristics, compare it with link-state protocols like OSPF, or recognize scenarios where RIP would or would not be appropriate. A typical Network+ question might ask: 'Which routing protocol uses hop count as its metric and has a maximum hop count of 15?' The correct answer is RIP.

For Cisco CCNA (200-301), RIP is covered under routing protocol fundamentals, though less emphasis is placed on it compared to OSPF. CCNA objectives include comparing and contrasting RIP with other interior gateway protocols. You may see configuration questions where you need to enable RIP on a router, advertise networks, or troubleshoot why routes are not being learned. The 'show ip route' command output will display RIP routes with an 'R' prefix. There is also a strong focus on understanding RIPv2 improvements over RIPv1, such as classless routing, authentication, and multicast updates.

For Linux-related certifications like LPIC-1 or RHCSA, RIP may come up in the context of dynamic routing in Linux environments. Tools like Quagga or FRRouting allow Linux servers to run RIP. You might need to know how to configure RIP daemons or verify routing tables. For general IT certifications like ITIL or PMP, RIP is less relevant, but still appears as a piece of background knowledge.

Exam questions about RIP often fall into three categories: definitions and features (e.g., 'What is the metric used by RIP?'), comparison questions (e.g., 'How does RIP differ from OSPF?'), and troubleshooting (e.g., 'Why is a route with 16 hops not appearing in the routing table?'). You should memorize the key timers (30-second update, 180-second invalid, 180-second hold-down, 240-second flush) and understand why the hop count limit exists (primarily to prevent routing loops).

## How it appears in exam questions

RIP questions on certification exams tend to follow specific patterns. The most common is the definition-based multiple-choice question. For example: 'Which of the following best describes the Routing Information Protocol?' The answer choices might include a description of OSPF's SPF algorithm, BGP's path-vector attributes, or a statement about hop count. You must recognize that RIP uses a distance-vector algorithm and hop count as the metric.

Another pattern is the scenario question. You might be given a network topology with several routers and asked to determine the route a packet will take if RIP is running. The question might show a diagram with hop counts between routers, and you need to calculate the shortest path based on total hops. For example: Router A is connected to Router B (2 hops to Network X), Router A to Router C (3 hops to Network X), and Router B to Router C (1 hop). The correct path from A to X would be A->B->C->X (4 hops) vs. A->C->X (4 hops), but since RIP often does not do load balancing unless equal-cost, you need to know which route is chosen.

Configuration and troubleshooting questions are also common. You might see a command like 'router rip' followed by 'network 192.168.1.0'. The exam might ask what this configuration does or why a certain network is not being advertised. You need to know that the 'network' command tells RIP which interfaces to participate in the routing process and which networks to advertise. Another tricky question: 'A network administrator issues the 'show ip route' command and sees a route flagged as 'R' with a metric of 1. What does this mean?' The answer: the destination is directly connected (1 hop) or reachable via a neighboring router that is one hop away.

Some exams include troubleshooting scenarios where a route is not appearing in the routing table. The issue could be that the hop count exceeds 15 (making it unreachable), or that split horizon is preventing the route from being advertised back to the source. You might also see questions about RIPv1 vs. RIPv2 differences, such as whether subnet masks are included. The key is to practice reading routing tables and understanding the timers.

## Example scenario

Imagine you are an IT technician for a small company with three routers: Router A, Router B, and Router C. Router A is connected directly to the 192.168.1.0 network. Router B is connected to Router A, and Router C is connected to Router B. Router C needs to reach the 192.168.1.0 network. All three routers are configured with RIP.

Initially, Router A sends out a RIP update to Router B, saying 'I can reach 192.168.1.0 with 0 hops (directly connected).' Router B receives this and creates a route: 'To reach 192.168.1.0, go through Router A, metric = 1 hop.' Router B then sends an update to Router C, including all its known routes. In that update, Router B says 'I can reach 192.168.1.0 with 1 hop.' Router C updates its routing table to show a route to 192.168.1.0 through Router B with a metric of 2 hops.

Now suppose the link between Router B and Router C goes down. Router C stops receiving updates from Router B. After 180 seconds (the invalid timer), Router C marks the route to 192.168.1.0 as invalid. It then waits another 180 seconds (hold-down timer) before accepting new information about that network. Meanwhile, Router B might still be sending updates to Router A about the route, and Router A might update its table. This is where split horizon matters: Router B should not advertise the route back to Router A because Router A is the source of that route. If split horizon were not in place, a routing loop could form.

Eventually, Router B detects the failure and stops advertising the route to 192.168.1.0. Router C, after the flush timer (240 seconds total), removes the route entirely. If there is an alternative path through another router, Router C might learn a new route with a higher hop count. This scenario shows how RIP's timers and split horizon work together to maintain network stability.

## Common mistakes

- **Mistake:** Thinking RIP uses a metric other than hop count, such as bandwidth or delay.
  - Why it is wrong: RIP exclusively uses hop count (number of routers traversed) as its metric. It ignores bandwidth, delay, reliability, or load. This is a fundamental characteristic that distinguishes RIP from protocols like OSPF or EIGRP.
  - Fix: Remember that RIP stands for 'Routing Information Protocol' and its metric is always hop count. The maximum hop count is 15.
- **Mistake:** Believing that RIPv1 supports CIDR and VLSM.
  - Why it is wrong: RIPv1 is a classful protocol, meaning it does not include subnet mask information in its updates. It cannot support Classless Inter-Domain Routing (CIDR) or Variable Length Subnet Masking (VLSM). These features were introduced in RIPv2.
  - Fix: RIPv1 assumes default subnet masks based on the IP address class. RIPv2 includes subnet masks. On exams, if the question mentions subnet masks in updates, it refers to RIPv2.
- **Mistake:** Assuming RIP converges instantly when a link fails.
  - Why it is wrong: RIP convergence is slow because it relies on periodic updates every 30 seconds and multiple timers (invalid, hold-down, flush) that last several minutes. It can take over 3 minutes for a failed route to be removed from all routers.
  - Fix: RIP is known for slow convergence. The protocol was designed for small, stable networks where fast adaptation to changes is not critical.
- **Mistake:** Confusing RIP's periodic update interval (30 seconds) with other timers like the hold-down timer (180 seconds).
  - Why it is wrong: The update timer triggers the sending of routing updates every 30 seconds. The hold-down timer (180 seconds) is used after a route goes down to prevent flapping and loops. They serve different purposes.
  - Fix: Use the mnemonic: 'Update every 30, hold down 180.' The update timer is the frequent one; the hold-down is a safety mechanism.
- **Mistake:** Thinking that RIP can be used on the internet core or very large networks.
  - Why it is wrong: RIP has a 15-hop limit, which restricts its use to networks where no path exceeds 15 routers. The internet core has far more than 15 hops. RIP is an Interior Gateway Protocol (IGP) for use within a single administrative domain, not for global routing.
  - Fix: RIP is suitable for small to medium-sized networks, typically within an organization. For large networks or the internet, protocols like OSPF, IS-IS, or BGP are used.

## Exam trap

{"trap":"The exam asks: 'Which routing protocol uses a metric of hop count and has a maximum of 15 hops?' Some answer choices may include OSPF, EIGRP, BGP, and RIP. Learners may choose OSPF because it also uses cost, but they forget that OSPF's cost is based on bandwidth, not hop count.","why_learners_choose_it":"Learners confuse the term 'cost' used in OSPF with the simple hop count metric of RIP. They may recall that OSPF computes shortest path but incorrectly associate the 15-hop limit with it, not realizing RIP's unique constraint.","how_to_avoid_it":"Memorize that RIP is the only common IGP that uses hop count as its sole metric and has a 15-hop limit. OSPF uses cost (based on bandwidth), EIGRP uses a composite metric (bandwidth and delay), and BGP uses path attributes. If the question says 'hop count,' the answer is always RIP."}

## Commonly confused with

- **RIP vs OSPF (Open Shortest Path First):** OSPF is a link-state routing protocol that builds a complete map of the network and uses the Shortest Path First (SPF) algorithm to find the best path based on cost (usually derived from bandwidth). In contrast, RIP is a distance-vector protocol that only knows the next hop and uses hop count as the metric. OSPF converges much faster than RIP and supports much larger networks (no 15-hop limit). (Example: If you have a network with a 1 Gbps link and a 100 Mbps link, OSPF will prefer the 1 Gbps link because it has a lower cost; RIP would prefer whichever path has fewer hops, even if it is the slow 100 Mbps link.)
- **RIP vs EIGRP (Enhanced Interior Gateway Routing Protocol):** EIGRP is a Cisco-proprietary advanced distance-vector routing protocol that uses a composite metric based on bandwidth and delay. It supports unequal-cost load balancing and has fast convergence through the use of feasible successors. RIP uses only hop count and converges slowly. EIGRP is more scalable and efficient than RIP. (Example: In a network with two paths to a destination, one with 2 hops (fast links) and one with 3 hops (slow links), EIGRP might choose the 3-hop path if the composite metric is better; RIP would always choose the 2-hop path regardless of speed.)
- **RIP vs BGP (Border Gateway Protocol):** BGP is a path-vector routing protocol used for routing between autonomous systems (ASes) on the internet. It uses a set of attributes (like AS path, next hop, local preference) to select routes. RIP is an interior gateway protocol used within a single AS. BGP has no hop count limit and is designed for the global internet, whereas RIP is limited to small networks. (Example: Your home network might use RIP to route between two small routers, but your internet service provider uses BGP to exchange routes with other ISPs across the world.)

## Step-by-step breakdown

1. **Router Initialization** — When a router running RIP is first powered on, it has no routes except for its directly connected networks. These directly connected routes are assigned a metric of 0 hops. The router then starts the RIP process and begins listening for updates on interfaces that have been configured for RIP.
2. **Sending Periodic Updates** — Every 30 seconds, the router sends a RIP update message to all its RIP-enabled neighbors. In RIPv1, the update is broadcast to 255.255.255.255. In RIPv2, the update is multicast to 224.0.0.9. The update contains the router's entire routing table (for RIPv1) or selected routes. This periodic behavior is critical for maintaining an up-to-date routing table across the network.
3. **Receiving Updates and Updating Routing Table** — When a router receives a RIP update from a neighbor, it processes each route in the update. For each route, it adds the metric from the neighbor (the number of hops the neighbor advertises) and then adds 1 (for the hop from the neighbor to itself). If the resulting metric is less than the current route (or if no route exists), the router updates its routing table with the new next-hop and metric. If the metric is higher, the router ignores the update (unless it came from the same next-hop, in which case it updates to prevent older information).
4. **Loop Prevention Mechanisms** — RIP uses several mechanisms to prevent routing loops. Split horizon prevents a router from advertising a route back out the interface from which it was learned. Route poisoning sets the metric of a failed route to 16 (unreachable) and advertises it to neighbors immediately. Hold-down timers prevent a router from accepting new information about a route for 180 seconds after it goes down, allowing time for the network to stabilize.
5. **Route Aging and Removal** — If a router does not hear an update about a route for 180 seconds (invalid timer), it marks that route as invalid. Then, during the hold-down period (another 180 seconds), the router will not accept new information for that route from any other source. After 240 seconds total (flush timer), the route is removed entirely from the routing table. This step ensures that stale routes are eventually purged.
6. **Triggered Updates** — When a route changes (e.g., a link goes down), the router immediately sends a triggered update, rather than waiting for the next 30-second periodic update. This helps speed up convergence by informing neighbors of the change as soon as possible. Triggered updates are a key feature for improving RIP's responsiveness.

## Practical mini-lesson

RIP in practice is often used in small, simple networks where ease of configuration outweighs the need for advanced features. To configure RIP on a Cisco router, you enter global configuration mode and issue the 'router rip' command. Then you use the 'version 2' command to enable RIPv2 (recommended) and use 'network' statements to advertise directly connected networks. For example, 'network 192.168.1.0' tells RIP to advertise the 192.168.1.0 network and enable RIP on all interfaces that fall within that network.

One common challenge in real-world RIP implementation is understanding the passive interface feature. If you have a router connected to a network segment that only has end devices, you do not want to send RIP updates out that interface (to save bandwidth and avoid unnecessary traffic). You can configure the interface as passive using 'passive-interface' under the RIP configuration. The interface will still receive updates but will not send them.

Another practical concern is RIP's use of bandwidth. In a network with many routers, the periodic full-table updates every 30 seconds can consume significant bandwidth. This is why RIP is often used only in networks with fewer than 20 routers. If you need a more scalable solution, you would migrate to OSPF or EIGRP.

Troubleshooting RIP involves using commands such as 'show ip route' to verify that routes are being learned, 'show ip protocols' to display RIP timers and configuration, and 'debug ip rip' to see real-time update messages. A typical problem is that a route is not showing up because the network statement is missing, or the route exceeds 15 hops. Another issue is that split horizon is preventing a router from learning a route from the wrong direction. In such cases, checking the routing table and the RIP database is essential.

For professionals working with Linux-based routers using Quagga or FRRouting, the configuration is similar. You start the ripd daemon, enter 'router rip' in the vtysh shell, and use 'network' commands. The same principles apply: hop count metric, 15-hop limit, and 30-second updates. Understanding RIP at this level gives you a solid foundation for grasping more complex routing protocols and for passing certification exams.

## Memory tip

RIP = Really Important Protocol? No! Remember RIP as 'RIP = 15 hops max, then it's dead.' The number 15 is the magic limit.

## FAQ

**What is the maximum number of hops in RIP?**

RIP has a maximum hop count of 15. Any route with a metric of 16 is considered unreachable. This limit helps prevent routing loops but restricts RIP to smaller networks.

**Is RIPv1 still used today?**

RIPv1 is rarely used today because it is classful and does not support subnet masks. Most modern implementations use RIPv2 or have migrated to OSPF. However, you might still find RIPv1 in very old or legacy networks.

**How often does RIP send updates?**

RIP sends periodic updates every 30 seconds. Triggered updates are sent immediately when a route changes, such as a link failure.

**What is split horizon in RIP?**

Split horizon is a loop prevention mechanism that prevents a router from advertising a route back out the interface from which it was learned. This avoids the situation where two routers keep sending each other the same route information.

**Can RIP be used on the internet?**

No, RIP is an Interior Gateway Protocol (IGP) designed for use within a single administrative domain. The internet core uses the Border Gateway Protocol (BGP) because it can handle thousands of routes and has no hop count limit.

**What is the difference between RIPv1 and RIPv2?**

RIPv1 is a classful protocol that does not include subnet mask information in updates and uses broadcast. RIPv2 is classless, includes subnet masks, supports authentication, and uses multicast (224.0.0.9) for updates.

**What is the purpose of the hold-down timer in RIP?**

The hold-down timer (180 seconds) prevents a router from accepting new information about a route for a period after it goes down. This helps prevent routing loops by giving the network time to stabilize before new routes are learned.

## Summary

RIP, or Routing Information Protocol, is one of the oldest and simplest dynamic routing protocols still in use. It operates on a distance-vector algorithm, using hop count as its only metric, with a strict maximum of 15 hops. Its periodic updates every 30 seconds and reliance on timers (invalid, hold-down, flush) make it easy to understand but slow to converge. RIPv2 added support for classless routing, authentication, and multicast updates, addressing some of RIPv1's limitations.

For IT certification seekers, RIP is essential knowledge because it appears in exams like CompTIA Network+ and Cisco CCNA. Understanding RIP helps you grasp the fundamentals of routing loops, split horizon, route poisoning, and distance-vector protocols in general. Even though OSPF and EIGRP are more common in modern enterprise networks, RIP's simplicity makes it a powerful teaching tool and a still-relevant protocol in small or legacy environments.

The key exam takeaways are: RIP uses hop count, maximum 15 hops, 30-second updates, classful (v1) vs. classless (v2), and slow convergence. Remember the timers: update 30 seconds, invalid 180, hold-down 180, flush 240. In troubleshooting, check for network statements, hop count limits, and split horizon. By mastering RIP, you build a solid foundation for more advanced routing concepts and improve your exam readiness.

---

Practice questions and the full interactive page: https://courseiva.com/glossary/rip