Learn what an OSPF adjacency provides, how area and virtual-link details shape it, and how to interpret several common troubleshooting signals.
What you will be able to do
- Explain why OSPF routers form adjacencies and what information they exchange.
- Determine which OSPF area governs an adjacency and its database synchronization.
- Identify the parameters and path-cost behavior of an OSPF virtual link.
- Interpret a sequence-number mismatch and selected operational conditions that affect adjacency troubleshooting.
01
Why Adjacencies Matter
An OSPF adjacency is a working relationship between two routers that allows them to exchange routing information. It forms only after the routers negotiate the parameters needed for that exchange.
Once the relationship is established, each router sends its neighbor a complete copy of its link-state database. This gives both routers the information needed to maintain a shared view of their area’s links.
02
The Area Boundary
Every OSPF adjacency belongs to exactly one area. When troubleshooting, treat the adjacency and its area as a pair rather than as separate details.
For example, if two routers establish an adjacency in Area A, their synchronization covers Area A’s database. It does not synchronize a different area’s database through that same adjacency.
03
A Practical Troubleshooting View
Start by asking whether the routers successfully negotiated the parameters required for adjacency formation. If they did not, the database exchange cannot begin.
Next, identify the area assigned to the adjacency and confirm that your expectation matches the database being synchronized. This separates an area-scope issue from a more general neighbor-formation problem.
04
How a Virtual Link Is Identified
A virtual link connects two area border routers through a non-backbone Transit area. Its configuration uses the Router ID of the other endpoint and the name of that Transit area.
The endpoint Router ID is not an arbitrary neighbor label. It identifies another area border router, and the receiving router must itself be an area border router to identify the configured endpoint in a packet.
05
How Its Cost Is Determined
A virtual link’s cost is the shortest intra-area path cost through the Transit area between its two endpoints. The virtual-link interface therefore receives an output cost that changes with that intra-area path cost.
For instance, if the shortest route through the Transit area becomes more expensive, the virtual link’s calculated output cost also reflects that new path cost. The value follows the Transit-area path rather than a separate fixed choice.
06
What an Established Virtual Link Does
After it is established, a virtual link appears in backbone router-LSAs and carries backbone-area OSPF packets across its adjacency. This makes the link visible as part of the backbone’s OSPF operation.
The link depends on both endpoints remaining reachable. If an area border router becomes unreachable, the virtual link and its associated adjacency should be removed.
07
Reading a Sequence-Number Mismatch
A sequence-number mismatch is an adjacency event with a specific consequence: the other endpoint processes the event and returns to ExStart state.
Use that transition as a clue during diagnosis. The important observation is not merely that synchronization stopped, but that the adjacency moved back to an earlier establishment state.
08
Operational Details to Check
OSPF troubleshooting guidance includes common neighbor-formation problems and commands for verifying them. Use those checks to compare the observed neighbor state with the expected formation process.
Changing a router’s OSPF Router ID does not take effect immediately. OSPF software must be restarted before the new identifier becomes active, so a troubleshooting check should account for that requirement.
On a non-broadcast network, delayed Link State Acknowledgments must be sent separately by unicast across each adjacency that is in Exchange state or a later state. This behavior matters when checking acknowledgment delivery between neighbors.
09
Recap Before Practice and Prove
An OSPF adjacency forms after parameter negotiation, then supports exchange of a complete link-state database copy. Use that sequence to distinguish formation problems from database-exchange problems.
Each adjacency belongs to one area, and synchronization through an adjacency covers that area’s database. When reviewing a neighbor relationship, always connect its state to its area.
A virtual link uses the other area border router’s Router ID and a non-backbone Transit area. Its cost follows the shortest intra-area path through that Transit area.
An established virtual link carries backbone-area OSPF packets and appears in backbone router-LSAs. If an endpoint becomes unreachable, the virtual link and its adjacency should be destroyed.
A sequence-number mismatch sends the other endpoint back to ExStart. Router ID changes require an OSPF restart, and non-broadcast acknowledgments are separately unicasted across qualifying adjacencies; these are the checks to apply in Practice and Prove.