Link-state routing algorithms

Link-state algorithms are used for intradomain routing. These use knowledge of the whole network - including topology and weights - to perform Dijkstra’s algorithm on the network to find the shortest path to every node. This gives us where to route packets to. The computational complexity of this is $O(n^2)$ where $n$ is the size of the network.