OSPF: Difference between revisions

Content added Content deleted
Line 300: Line 300:
*Determine which router is in charge of the database synchronization process.
*Determine which router is in charge of the database synchronization process.
*Determined by priority, Router-ID breaks Tie if all have same priority
*Determined by priority, Router-ID breaks Tie if all have same priority
*The higher router ID of the two neighbors controls which router becomes the master.
|-
|-
|'''6. Exchange'''||
|'''6. Exchange'''||
*The local router and its neighbor exchange DBD packets listing LSAs in their LS database by RID & sequence number that describe their local databases.
*The local router and its neighbor exchange DBD packets listing LSAs in their LS database by RID & sequence number that describe their local databases.
*Master sends DBD first, then Slave sends it.
|-
|-
|'''7. Loading'''||
|'''7. Loading'''||
Line 309: Line 309:
*It then sends a LSR for missing or outdated LSAs.
*It then sends a LSR for missing or outdated LSAs.
*Each router responds to its neighbor's LSR with a LSU.
*Each router responds to its neighbor's LSR with a LSU.
*Slave sends LSR first, Master sends LSU with multiple LSAs.
*Master sends LSR, Slave sends LSU with multiple LSAs.
*Each LSU is acknowledged.
*Each LSU is acknowledged.
|-
|-
Line 316: Line 318:
*Local router is having received a complete link-state database from its peer.
*Local router is having received a complete link-state database from its peer.
*Both neighboring routers in this state add the adjacency to their local database and advertise the relationship in a link-state update packet.
*Both neighboring routers in this state add the adjacency to their local database and advertise the relationship in a link-state update packet.
*SPF algorithm is run to find best paths to each route & put it in Routing Table.
|}
|}
<br />
<br />
Retrieved from "https://aman.awiki.org/wiki/OSPF"