TechKnowSurge
Cisco CCNA 3.2 Cisco CCNA 3.1 Cisco CCNA 3.4
InteractiveNetworkFree

Routing Protocol Behavior Predictor

Predict which path a router picks, and what it learns, when its network runs RIP, OSPF or EIGRP.

⚑ Complete this interactive to capture a CTF flag worth 5 points.

About this interactive

From the lesson: - **Choosing a path:** RIP counts hops and nothing else, so it takes the shorter path even over slow links and ranks equal hop counts as a tie. OSPF adds up a cost set by each link's bandwidth, so faster links win. EIGRP builds its metric from bandwidth and delay. - **What a router knows:** a distance vector router such as a RIP router sees only a direction and a distance from each neighbor and has no map. A link state router holds a map of the whole network and calculates its own paths with Dijkstra's algorithm. - **How a network settles:** link state routers flood small updates and recalculate, so they converge faster and scale better. Distance vector routers pass whole tables from neighbor to neighbor, are prone to loops and, with RIP, stop at 15 hops. They need less CPU and memory. - **Speaking the same protocol:** a router learns its connected networks on its own, and the rest only from a routing protocol. Two routers must run the same protocol to trade routes.

What you'll learn

Aligned to

Cisco CCNA
3.2 Determine how a router makes a forwarding decision by default
3.1 Interpret the components of routing table
3.4 Configure and verify single area OSPFv2

Key terms

Dynamic Routing Protocol
A routing protocol that automatically discovers remote networks and populates a router's routing table by exchanging routing information with neighboring routers.
Hop Count
A metric used by distance vector protocols that counts the number of routers a packet must pass through to reach its destination.
Metric
A value used by a router to determine the preferred path to a destination when multiple routes exist; lower values typically indicate a more preferred route.
Distance Vector
DV
A type of routing algorithm where each router periodically shares its entire routing table with directly connected neighbors, calculating the best path based on a distance metric such as hop count. Distance vector protocols such as RIP converge more slowly than link-state protocols but are simpler to configure.
Link State
LS
A routing algorithm category where each router maintains a complete map of the network topology and independently calculates shortest paths using Dijkstra's SPF algorithm. Link-state protocols such as OSPF and IS-IS converge faster and scale better than distance-vector protocols.
OSPF Cost
A metric assigned to each router interface, calculated by dividing the reference bandwidth by the interface bandwidth; lower cost indicates a preferred path.
Network Convergence
The state in which all routers in a network have consistent and complete routing information about every reachable network.
Dijkstra's Algorithm
A shortest-path algorithm used by OSPF to calculate the lowest-cost path to every destination network based on the link-state database.

Topics

Dynamic Routing Distance Vector Link State Rip Ospf Eigrp Hop Count Interactive Predict

About TechKnowSurge

TechKnowSurge builds IT and cybersecurity professionals through hands-on, concept-first training built around real understanding — not memorization. Free interactive tools, structured programs, and 25+ years of real-world experience, all in one place.

Explore free tools and programs →