When One Area Is Not Enough
Areas, Area 0, and the three things this simulator does not model
Step 1 of 2 — understand the idea. Read this first and the packet trace will confirm what you already expect, instead of teaching you two things at once.
What you'll be able to do
- ▸Explain what grows when an OSPF area grows, and why that eventually hurts
- ▸Say what an area boundary changes about flooding and about SPF
- ▸Name what this simulator does not model, and what that means for what you have seen
Before this lesson — it builds directly on:
OSPF's guarantee is that every router in an area holds the same database and therefore computes a consistent answer. That guarantee is what makes it trustworthy, and it is also what limits how big an area can be — because "every router holds everything" stops being free somewhere between ten routers and a thousand.
Areas exist to bound the guarantee. Inside an area, the full topology. Across a boundary, a summary: here is a network, here is roughly how far, and nothing about what is behind it.
- Area
- A group of routers that flood link-state information to each other and no further. Identified by a dotted quad, which is an identifier rather than an address.
- Area 0 (the backbone)
- The area every other area must attach to. Inter-area routes travel through it, and that rule is what stops them looping.
- Area Border Router
- A router with interfaces in more than one area. It does not pass topology across; it generates summaries of one area into the other.
- ECMP
- Equal-cost multipath — installing more than one next hop for a prefix when the costs tie. Real routers do this; this simulator installs one and breaks the tie.
✓ Concept check — before you open the packets
These test the idea, not the trace. You should be able to answer them from the explanation above.
Now that you understand the concept, observe how it appears in the packet exchange.
The lab runs a real simulated capture — pause, step, click any packet, and inspect every byte.