Link state routing protocols use Dijkstra’s algorithm, commonly known as Shortest Path First (SPF) algorithm. SPF accumulates each path’s cost along the way form source to destination. Each router chooses the best route that has the least metric.
Upon receiving link state information from other routers, each router builds its own tree topology of the entire network.
Upon receiving link state information from other routers, each router builds its own tree topology of the entire network.
1- Routers identify themselves and gather information about other directly connected routers; this is done by exchanging Hello packets from which they can build the Neighbour Table.
2- After adjacency is established, each router builds its own Link-state Table (LST). LST contains all the information about directly connected links, such as type, state, bandwidth and neighbour ID.
3- Link state protocols then distribute its LST once a change occurs in the topology, consequently, routers process these updates simultaneously achieving a speedy convergence time.
4- Routers build up their Link State Database (LSDB) for the entire network within the routing domain, and then each router constructs a logical tree putting itself in the root position.
5- By using Dijkstra’s SPF algorithm against the LTS, routers can derive the shortest path with the lowest cost and maintain their routing table.
0 comments:
Post a Comment