Link-state routing

ƒ Same assumptions/goals, but different idea than DV: ƒ Tell all routers the topology and have each compute best paths ƒ Two phases: 1. Topology dissemination (flooding)-New News travels fast.-Old News should eventually be forgotten 2. Shortest-path calculation (Dijkstra's algorithm)-nlogn