liveBook · Manning

Full state

As explained in Acing the CCNA Exam: Volume 1 Fundamentals and Protocols

An OSPF full adjacency is a synchronized relationship in which neighboring routers have exchanged link-state information and synchronized their link-state databases.

Full is the final OSPF neighbor state. Routers in Full state are fully adjacent: they have exchanged link-state advertisements and synchronized their link-state databases. This synchronization allows them to exchange routing information reliably. The sequence leading to Full is Down, Init, 2-Way, ExStart, Exchange, Loading, and Full; a general understanding of each state and its order is sufficient for CCNA-level study. section 18.3.1 section 18.5

Interpret Full according to the OSPF network type:

  • On a broadcast segment, routers form full adjacencies with the designated router (DR) and backup designated router (BDR). DROthers remain in the 2-Way state with one another. section 18.3.2 section 18.5
  • On a point-to-point connection, the routers establish a Full adjacency without electing a DR or BDR. section 18.3.2
  • Verify the state with show ip ospf neighbor; output such as FULL/DR, FULL/BDR, or FULL/- indicates a synchronized adjacency and identifies the neighbor’s segment role. section 18.3.2 section 18.5

Checking a point-to-point adjacency

Configure the same point-to-point network type on both interfaces with ip ospf network point-to-point. The neighbor table can then show FULL/- for the connected router, confirming Full adjacency without DR/BDR election. section 18.3.2

Figure 18.9 The OSPF neighbor states: Down, Init, 2-Way, ExStart, Exchange, Loading, and Full. Routers that reach the 2-Way state are OSPF neighbors. Some routers remain in this state, and some proceed to establish a full adjacency.

Use the neighbor-state diagram to place Full after Down, Init, 2-Way, ExStart, Exchange, and Loading, and to distinguish full adjacencies from ordinary 2-Way neighbor relationships. section 18.3.1

How Acing the CCNA Exam: Volume 1 Fundamentals and Protocols covers it

How deep it goes
Explains Full within the seven-state sequence and adjacency rules, but defers detailed protocol-state mechanics beyond general CCNA understanding.
Examples
Uses show ip ospf neighbor output and a point-to-point configuration producing FULL/- to demonstrate verification.
What it assumes
Assumes basic OSPF neighbor terminology while establishing the state sequence and explaining neighbor discovery through hello messages.
What you can do after
Diagnose/debug OSPF adjacency relationships by reading neighbor states and distinguishing Full from 2-Way on broadcast segments.
How it connects
Connects Full with OSPF neighbor states, link-state advertisements, link-state databases, DR/BDR election, and network types.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Acing the CCNA Exam: Volume 1 Fundamentals and Protocols. The section links point to the parts of the book it draws on.