Scribd
Upload
6 views

Open Shortest Path First

Uploaded by

singarman881
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Open Shortest Path First

Uploaded by

singarman881
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Open Shortest Path First (OSPF) States

The device operating OSPF goes through certain states. These states are:

Down State

 No Hello packets have been received on the interface.

 This is the initial state before communication begins between


routers. The OSPF adjacency process has not started yet.

Note: The Down state does not imply that the interface is physically
down; it simply means that the OSPF router has not started the process of
forming adjacencies.

Init State

 The router receives a Hello packet from another router but is not yet
listed in the neighbor’s Hello packet.

 The router has begun communication, but no bidirectional


communication has been established yet.

Two-Way State

 Bi-directional communication is confirmed when each router sees


itself in the other's Hello packet.

 In broadcast or multi-access networks, this is the point at which the


Designated Router (DR) and Backup Designated Router (BDR)
election takes place.

ExStart State

 The Master/Slave relationship is established for Database


Description (DBD) exchange.

 Routers exchange initial DBD packets, which contain the sequence


numbers, indicating the beginning of the exchange phase. The
router with the higher Router ID becomes the master, while the
other becomes the slave.

Exchange State

 In this state, routers exchange full Database Description (DBD)


packets, which contain the headers of Link State Advertisements
(LSAs).

 Routers create Link-State Request (LSR) lists to request missing


LSAs that are not present in their own Link-State Database (LSDB).

Loading State
 Routers send Link-State Request (LSR) packets to request missing
LSAs.

 The routers respond with Link-State Update (LSU) packets, which


contain the requested LSAs.

Note: If a router receives a DBD from another router and finds that the
received DBD is more up-to-date than its own, it will send an LSR to
request missing links. The other router will reply with an LSU containing
the missing updates, and a Link State Acknowledgment (LSA) is sent in
return.

Full State

 The adjacency between routers is fully established.

 The Link-State Databases (LSDB) are synchronized, meaning both


routers have identical databases.

 Routers can now compute the shortest paths using the Shortest Path
First (SPF) algorithm, marking the point where routing decisions can
be made.

You might also like