Link State protocols
Links and attributes (states) instead of destinations and distances
Each node collects the state (cost etc) of its connected links to form a “Link State Packet” (LSP)
The LSP from every node is broadcast to reach every other node in the network.
Now each node has an entire “map” of the network in terms of link states.
It then runs a *local* shortest path algorithm (Dijkstra’s algo) and finds shortest path to all destinations. The routing table is formed from the next hop on each of these shortest paths.