About this interactive
The lesson's three sources:
- **Connected:** an interface gets an address and mask and comes up, and its network goes in by itself. Code C on a Cisco router (with L for the interface's own address).
- **Static:** an administrator enters the route by hand, with a next-hop address or an exit interface. It does not change unless someone edits it. Code S; S* marks a static default route.
- **Dynamic:** routers running the same routing protocol share what they know, so each learns the remote networks and finds another way when a link goes down. Code R for RIP, O for OSPF, D for EIGRP; a learned route carries a timer so it can expire if updates stop.
Static routes take time to enter on many routers; dynamic routing saves that time and adapts.
What you'll learn
- Decide how a route got into the routing table: connected (an interface came up), static (entered by hand) or dynamic (learned from other routers)
- Read a route's source code (C, S, R, O on a Cisco router) and weigh static routes against dynamic routing protocols: hand upkeep against automatic learning and rerouting
Aligned to
Cisco CCNA
3.1
Interpret the components of routing table
CompTIA Network+
2.1
Explain characteristics of routing technologies.
Cisco CCST Networking
4.4
Explain basic routing concepts
Key terms
- Connected Route
- A route automatically added to a router's routing table when a directly attached interface is configured and active.
- Static Route
- A routing table entry manually configured by an administrator that specifies a fixed path to a destination network and never changes unless the administrator modifies it. Static routes are simple and predictable but do not adapt automatically to network topology changes.
- 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.
- Routing Information Protocol
RIP
- One of the oldest distance-vector routing protocols, using hop count as its sole routing metric with a maximum of 15 hops to prevent routing loops. RIP sends full routing table updates periodically and converges slowly compared to modern protocols, making it suitable only for small networks.
- Open Shortest Path First
OSPF
- A link-state interior gateway routing protocol that maintains a complete map of the network topology and uses Dijkstra's Shortest Path First algorithm to calculate optimal, loop-free routes. OSPF divides networks into hierarchical areas to improve scalability and supports VLSM and rapid convergence.
Topics
Routing Table
Connected Route
Static Route
Dynamic Routing
Interactive
Categorize
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 →