Link-State Routing
In DV, the path or cost to destination is partially determined by its neighbors
With LS, every router gets complete topology information. Using same algorithms, will compute same paths (avoiding loops)
Two components: topology dissemination and shortest-path algorithm