Previously, we have discussed distance vector routing.
Here is the link if you haven't seen it yet -
Now we are going to see about Link State Routing which is also a category of intradomain routing.
In Link state routing, four sets of actions are required to ensure that each node in the routing table is showing the least cost to reach the other node.
Four sets of actions are:
- Creation of the states of the links by each node (router), called Link State Packet (LSP).
- Sending LSPs of each router to every other router through a mechanism called 'Flooding' in an efficient and reliable way.
- Formation of shortest-path tree for each node (Using Dijkstra's algorithm).
- Calculation of routing table based on shortest-path tree.
Note:
- A small packet that consists of routing information is called Link state Packet (LSP).
- When LSPs are generated?
i) Whenever there is any change in topology.
ii) Generated on a periodic basis.
Comments
Post a Comment