Before routers can exchange routing information using OSPF, they must first form a neighbor relationship. This process happens through a sequence of OSPF Neighbor States, each representing a step toward full database synchronization.

Let's break down each state by using an example with:
R1 - Router ID 1.1.1.1
R2 - Router ID 2.2.2.2
🔗 If you haven't already, start with the OSPF Router ID lesson to understand how each router identifies itself in OSPF.
Answer the question below
Click 'Complete' to continue
This is the starting point.
OSPF is enabled on the interface, but no Hello packets have been sent or received.
Figure 1 – Two OSPF routers in Down state, no Hello packets exchanged.
The neighbor table is empty, and the router is simply waiting for communication.
Answer the question below
Which OSPF state is the starting point, before any Hello packet has been sent or received?
The router begins sending Hello packets to 224.0.0.5, the multicast address used by OSPF-enabled routers.

Figure 2 – OSPF Init state.
Each Hello packet includes:
The Router ID: 1.1.1.1
Neighbor ID: 0.0.0.0 (no neighbors seen yet)
The Area ID
Hello and Dead timers
At this stage, the router is saying:
I'm here, and I'm ready to form neighbors if we match our Area ID and Hello and Dead Timers interval.
Answer the question below
What is the multicast address used by OSPF Hello packets?
Another router (let's say R2) receives the Hello from R1 and responds with a Hello packet.
R2 includes both its own Router ID and the Router ID of R1.
Figure 3 – OSPF Two-Way state.
When R1 sees its own ID in R2's Hello, it knows:
“This router has seen me. We can now become neighbors.”
R1 adds R2 to its neighbor table and sends a final Hello packet to inform R2 that it recognizes it as a neighbor.

Figure 4 – Mutual neighbor confirmation; Two-Way reached.
Both routers now add each other to their neighbor table.
They have reached the Two-Way state.
Figure 5 – Both routers list each other as neighbors in Two-Way state.
At this moment, you can actually verify it on the router.
On R1, type:R1# show ip ospf neighbor Neighbor ID Pri State Dead Time Address Interface 2.2.2.2 1 2WAY/DR 00:00:38 192.168.1.2 GigabitEthernet0/0If you see 2WAY, it means the routers have discovered each other and acknowledged their presence.
On point-to-point links, this state is usually very brief and routers quickly move to ExStart.
On Ethernet networks, a DR/BDR election must occur before full adjacency is formed.Don't worry about DR/BDR for now: we'll cover it in the next lesson.
Database Synchronization - Exchange LSAs
Once routers reach the Two-Way state, they are ready to synchronize their Link-State Databases (LSDBs). This process ensures both routers have the same view of the network topology. It happens in four more steps.
Answer the question below
Which state does show ip ospf neighbor display once both routers list each other in their neighbor table?
Before exchanging link-state information, routers must agree on who will send the first Database Description (DBD) packet.
Both routers initially claim to be the master by sending a DBD that includes their own Router ID.
Figure 6 – OSPF ExStart state, master role negotiation.
The router with the highest Router ID wins the election and becomes the master.
This router controls the database exchange process.At this moment, the adjacency is still forming.
On a real router, this state is usually extremely brief.If you check quickly on R1, you might see:
R1# show ip ospf neighbor Neighbor ID Pri State Dead Time Address Interface 2.2.2.2 1 EXSTART/DR 00:00:37 192.168.1.2 GigabitEthernet0/0If you see EXSTART, it means the routers are negotiating the master/slave roles before exchanging their LSDB summaries.
In most cases, the state quickly transitions to EXCHANGE.Answer the question below
What determines which router becomes the master in ExStart?
Since R2 has the higher Router ID, it sends the first Database Description (DBD) packets, summarizing its LSDB contents.

Figure 7 – OSPF Exchange state, LSDB summaries swapped.
R1 responds with its own DBD packet in return, which implicitly acknowledges R2's DBD.
R2 acknowledges R1's DBD, completing the exchange phase.Answer the question below
Which OSPF packet summarizes the LSDB contents?
In the Loading state, each router compares the received DBD summaries with its own LSDB.

Figure 8 – OSPF Loading state, requesting and receiving LSAs.
If it finds missing or outdated LSAs, it sends a Link-State Request (LSR) to the neighbor.
The neighbor replies with Link-State Update (LSU) packets containing the requested LSAs, which are then acknowledged.Answer the question below
Which packet is sent to request missing LSAs?
Once all requested LSAs are received and acknowledged, both routers reach the Full state.

Figure 9 – OSPF Full state, LSDBs fully synchronized.
Their Link-State Databases (LSDBs) are now fully synchronized.
The adjacency is complete. From this point on, LSUs are only exchanged during topology changes or periodic refreshes every 30 minutes.Let's verify that the adjacency is fully established.
On R1, type:R1# show ip ospf neighbor Neighbor ID Pri State Dead Time Address Interface 2.2.2.2 1 FULL/DR 00:00:33 192.168.1.2 GigabitEthernet0/0Just focus on the State column.
If you see FULL, it means:The adjacency is complete
The LSDBs are synchronized
OSPF is fully operational between the routers
In real networks, you will almost always see the FULL state once OSPF is stable.
Answer the question below
Once the Full state is reached, LSAs are only refreshed periodically. Every how many minutes?
Before OSPF routers can exchange routing information, they must first become neighbors.
To achieve that, they go through a series of OSPF neighbor states, each with a specific purpose:
Figure 10 – Summary of all OSPF neighbor states from Down to Full.
This process ensures both routers are fully aligned before any routes are exchanged.
Answer the question below
What must OSPF routers go through before they can exchange routing information?
To transition through each state, OSPF uses specific packet types. Knowing them is essential for your CCNA:
Step
Packet Type
Role
1
Hello (Type 1)
Discovers neighbors and checks key OSPF parameters
2
DBD (Type 2)
Sends LSDB summary so the neighbor can detect missing or outdated LSAs
3
LSR (Type 3)
Requests specific LSAs from the neighbor
4
LSU (Type 4)
Provides the requested LSAs or advertises new ones
5
LSAck (Type 5)
Acknowledges each received LSU packet
Table 1 – OSPF packet types and their roles.
These packets are essential to establish and maintain OSPF neighbor relationships.
Answer the question below
Which OSPF packet type (Type 3) requests specific LSAs from a neighbor?