Link state routing algorithm in computer network

     Link state routing algorithm

Link State Routing –
Link state routing is the second family of routing protocols. While distance vector routers use a distributed algorithm to compute their routing tables, link-state routing uses link-state routers to exchange messages that allow each router to learn the entire network topology. Based on this learned topology, each router is then able to compute its routing table by using a shortest path computation.


Features of link state routing protocols –

  • Link state packet – A small packet that contains routing information.
  • Link state database – A collection information gathered from link state packet.
  • Shortest path first algorithm (Dijkstra algorithm) – A calculation performed on the database results into shortest path
  • Routing table – A list of known paths and interfaces.
Calculation of shortest path –
To find shortest path, each node need to run the famous Dijkstra algorithm. This famous algorithm uses the following steps:
  • Step-1: The node is taken and chosen as a root node of the tree, this creates the tree with a single node, and now set the total cost of each node to some value based on the information in Link State Database
  • Step-2: Now the node selects one node, among all the nodes not in the tree like structure, which is nearest to the root, and adds this to the tree.The shape of the tree gets changed .
  • Step-3: After this node is added to the tree, the cost of all the nodes not in the tree needs to be updated because the paths may have been changed.
  • Step-4: The node repeats the Step 2. and Step 3. until all the nodes are added in the tree
Link State protocols in comparison to Distance Vector protocols have:
  1. It requires large amount of memory.
  2. Shortest path computations require many CPU circles.
  3. If network use the little bandwidth ; it quickly reacts to topology changes
  4. All items in the database must be sent to neighbors to form link state packets.
  5. All neighbors must be trusted in the topology.
  6. Authentication mechanisms can be used to avoid undesired adjacency and problems.
  7. No split horizon techniques are possible in the link state routing.

Comments

Popular posts from this blog

INTRODUCTION OF DBMS

Introduction of Digital computer

DEVELOPED, UNDEVELOPED AND DEVELOPING ECONOMIES || LIST, GDP, UNEMPLOYMENT