Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Open Shortest Path First
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
====Database exchange==== [[File:OSPF-Adjacency-process-Neighbor state changes (Database Exchange).drawio.png|thumb|Neighbor state changes (database exchange)]] #Exchange start (exstart): The ''exstart'' state is the first step of adjacency of two routers. #Exchange: In the ''exchange'' state, a router is sending its link-state database information to the adjacent neighbor. At this state, a router can exchange all OSPF routing protocol packets. #Loading: In the ''loading'' state, a router requests the most recent [[link-state advertisement]]s (LSAs) from its neighbor discovered in the previous state. #Full: The ''full'' state concludes the conversation when the routers are fully adjacent, and the state appears in all router- and network-LSAs. The link-state databases of the neighbors are fully synchronized.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)