Ospf States
Ospf States
Ospf States
information (hellos) has been received from this neighbor, but hello packets can still be sent to the neighbor in this state. During the fully adjacent neighbor state, if a router doesn't receive hello packet from a neighbor within the RouterDeadInterval time (RouterDeadInterval = 4*Hello Interval by default) or if the manually configured neighbor is being removed from the configuration, then the neighbor state changes from Full to Down.
neighbors in an NBMA environment. In Attempt state, the router sends unicast hello packets every poll interval to the neighbor, from which hellos have not been received within the dead interval.
packet from its neighbor, but the receiving router's ID was not included in the hello packet. When a router receives a hello packet from a neighbor, it should list the sender's router ID in its hello packet as an acknowledgment that it received a valid hello packet
link state information can start between the routers and their DR and BDR. In this state, the routers and their DR and BDR establish a masterslave relationship and choose the initial sequence number for adjacency formation. The router with the higher router ID becomes the master and starts the exchange, and as such, is the only router that can increment the sequence number. Note that one would logically conclude that the DR/BDR with the highest router ID will become the master during this process of masterslave relation. Remember that the DR/BDR election might be purely by virtue of a higher priority configured on the router instead of highest router ID. Thus, it is possible that a DR plays the role of slave. And also note that master/slave election is on a perneighbor basis.
OSPF NEIGHBOR STATES CONT Exchange In the exchange state, OSPF routers exchange database
descriptor (DBD) packets. Database descriptors contain linkstate advertisement (LSA) headers only and describe the contents of the entire linkstate database. Each DBD packet has a sequence number which can be incremented only by master which is explicitly acknowledged by slave. Routers also send linkstate request packets and linkstate update packets (which contain the entire LSA) in this state. The contents of the DBD received are compared to the information contained in the routers linkstate database to check if new or more current linkstate information is available with the neighbor
information occurs. Based on the information provided by the DBDs, routers send linkstate request packets. The neighbor then provides the requested linkstate information in linkstate update packets. During the adjacency, if a router receives an outdated or missing LSA, it requests that LSA by sending a linkstate request packet. All linkstate update packets are acknowledged
OSPF NEIGHBOR STATES CONT Full In this state, routers are fully adjacent with each other.
All the router and network LSAs are exchanged and the routers' databases are fully synchronized. Full is the normal state for an OSPF router. If a router is stuck in another state, it's an indication that there are problems in forming adjacencies. The only exception to this is the 2way state, which is normal in a broadcast network. Routers achieve the full state with their DR and BDR only. Neighbors always see each other as 2way.