Link State Routing (cont.)

• Routing updates are “flooded” to all nodes

• • When a router boots or when the state of any of its links changes, it sends a link state update to all of its neighbor routers
  • When a router receives a link state update from another router, it stores the information and propagates the information to all of its neighbor routers

• Once OSPF has stabilized, shortest path route calculations are fast and accurate

• • Whenever a routers link state database changes (either via a change of its own link state or via reception of a link state update), it runs the Dijkstra algorithm on the database
  • Fast convergence when the network topology changes