Routers do one thing: look up destinations in a table and forward packets. Today you learn how routing tables are built, how OSPF and BGP propagate reachability, and why the internet does not collapse when a fiber gets cut.
By the end of this lesson you will read a routing table and trace a packet's path, configure a static route on a Linux machine, explain OSPF link-state convergence, describe BGP's role in inter-AS routing, and explain longest-prefix match with an example.
routing tables is the foundation of Day 3. Every concept that follows builds on the mental model you establish here. The most effective approach is to understand the principle first, then apply it — skipping straight to implementation creates gaps that compound into confusion later.
Work through each example in this lesson sequentially. The concepts connect, and the order is deliberate. If something is unclear, slow down at that point rather than pushing past it — a ten-minute pause now saves hours of debugging later.
Understanding routing tables requires seeing it in motion. The code below is not a complete application — it is a minimal, working illustration of the key mechanism. Study the pattern, run it, break it deliberately, then fix it. That cycle builds real comprehension.
Once the basic pattern works, the logical next step is static routing. This is where the abstraction becomes useful — you move from understanding the mechanism to applying it to real problems. The transition is usually smaller than it feels. Most of the hard work happened in Section 1.
OSPF completes today's picture. It is where routing tables and static routing converge into a pattern you can apply to novel problems. This integration step is often where the day's learning consolidates — if the earlier sections felt abstract, this one typically makes them click.
Implementing routing tables alone handles the happy path. Real systems encounter edge cases, invalid input, and unexpected state. Missing static routing means missing those guards.
Combining routing tables with static routing gives you a complete, defensible implementation. The extra lines cost ten minutes; the robustness they add is worth hours of debugging time.
Several mistakes appear consistently when engineers encounter Routing for the first time. Recognizing them now costs nothing; encountering them in production costs hours.
Two intensive days (Thu–Fri) with an instructor who has taught thousands of engineers. Cohorts in 5 cities, June–June–October 2026 (Thu–Fri).
Reserve Your Seat — $1,490Before moving on, you should be able to answer these without looking: