what is the stateful order in which an OSPF router transitions to a full adjacency with a neighbor router?

According to RFC 2328, what is the stateful order in which an OSPF router transitions to a full
adjacency with a neighbor router?

According to RFC 2328, what is the stateful order in which an OSPF router transitions to a full
adjacency with a neighbor router?

A.
Down, Init, 2-Way, Exstart, Exchange, Loading, and Full

B.
Down, Init, 2-Way, Exchange, Exstart, Loading, and Full

C.
Down, 2-Way, Init, Loading, Exstart, Exchange, and Full

D.
Down, 2-Way, Init, Exchange, Exstart, Loading, and Full

E.
Down, Init, 2-Way, Loading, Exstart, Exchange, and Full

F.
Down, 2-Way, Init, Exstart, Exchange, Loading, and Full

Explanation:
When OSPF adjacency is formed, a router goes through several state changes before it becomes
fully adjacent with its neighbor. The states are Down -> Attempt (optional) -> Init -> 2-Way ->
Exstart -> Exchange -> Loading -> Full. Short descriptions about these states are listed below:
Down: no information (hellos) has been received from this neighbor.
Attempt: only valid for manually configured 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.
Init: specifies that the router has received a hello packet from its neighbor, but the receiving
router’s ID was not included in the hello packet2-Way: indicates bi-directional communication has
been established between two routers.
Exstart: Once the DR and BDR are elected, the actual process of exchanging link state
information can start between the routers and their DR and BDR.
Exchange: OSPF routers exchange database descriptor (DBD) packets
Loading: In this state, the actual exchange of link state information occurs
Full: routers are fully adjacent with each other
(Reference:
http://www.cisco.com/en/US/tech/tk365/technologies_tech_note09186a0080093f0e.shtml)



Leave a Reply 0

Your email address will not be published. Required fields are marked *