Link State protocols
Create a network “map” at each node.
- For a map, we need inks and attributes (link states), not of destinations and metrics (distance vector)
1. Node collects the state of its connected links and forms a “Link State Packet” (LSP)
2. Broadcast LSP => reaches every other node in the network.
3. Given map, run Dijkstra’s shortest path algorithm => get paths to all destinations
4. Routing table = next hops of these paths.