Distance vector Routing and Link State Routing Protocol


In computer networks, The process of choosing a path between two or more networks is known as network routing. Any network, including those used for public transit and telephone networks, can use the routing principles.

fig: Routing protocol

Distance vector Routing Protocols

  • In this protocol, as the name implies, each node maintains a vector (table) of minimum distances to every node.
  • It is a dynamic routing algorithm in which each router computes a distance between itself and each possible destination i.e. its immediate neighbors.
  • The sharing of information with the neighbors takes place at regular intervals.
  • It works on Bellman-Ford Algorithm.
  • Problems:
    1. Good news spread fast and bad news spread slowly.
    2. Persistent looping problem i.e. loop will be there forever.

Link State Routing Protocol

  • In this protocol, each node in the domain has the entire topology of the domain the list of nodes and links, and how they are connected including the type, cost (metric), and condition of the links (up or down).
  • It is a dynamic routing algorithm in which each router shares knowledge of its neighbors with every other router in the network.
  • The sharing of information takes place only whenever there is a change.
  • It works of Dijkstra’s Algorithm.
  • Problem:
    1. Heavy traffic due to flooding of packets.
    2. Flooding can result in infinite looping which can be solved by using the Time to live (TTL) field.

Comparison Between Distance Vector Routing Protocol and Link State Routing Protocol

%d bloggers like this: