Link State Routing
Works by storing the entire network’s graph and running a path-finding algorithm such as djikstra when a packet needs to be routed. For routers to learn about the state of the entire networ, the following algorithm is used.
- Routers announce information about their neighours.
- Other routers who receive the announcement update their graphs and announce what they learned. This allows knowledge to be propagated accross the network.
- Once all the information is shared, routers learn nothing new so the communication regarding the network stops.