Open In App

Difference between Distance vector routing and Link State routing

Last Updated : 19 Feb, 2025
Comments
Improve
Suggest changes
Like Article
Like
Report

Routing is a process in computer networks which is used to find best path to transmit data packets from one node to another. Distance Vector Routing and Link State Routing are two most used dynamic routing algorithms. They both are a part of Intradomain routing which refer to routing of devices within a same network.

Distance Vector Routing

Distance Vector Routing is an algorithm that is subject to change where a router calculates distances to every possible destination based on its immediate neighbors only, the router’s routing table is shared with routers that are directly connected, during regular intervals, this received information makes the routers update their tables while route computation uses Bellman-Ford algorithm most of the time, in spite of being relatively simple. However, Distance Vector Routing has some problems such as Count to Infinity or persistent routing loops.

Read more about Distance Vector Routing.

Link State Routing

Link State Routing, as opposed to Distance Vector Routing, is a dynamic routing algorithm such that each router maintains knowledge of the entire network, instead of sharing information only with neighbors, routers flood their link state information across the entire network to make sure all routers have the same view of the network topology, Dijkstra’s Algorithm and other Link State Routing algorithms are employed in order to compute shortest path to all destinations, it does not lead to persistent loop but it can result in more network traffic due to flooding link state information.

Read more about Link State Routing.

Distance Vector Routing Vs Link State Routing

Comparison between Distance Vector Routing and Link State Routing

Distance Vector Routing Link State Routing
Bandwidth required is less due to local sharing, small packets and no flooding. Bandwidth required is more due to flooding and sending of large link state packets.
Based on local knowledge, since it updates table based on information from neighbours. Based on global knowledge, it have knowledge about entire network.
Make use of Bellman Ford Algorithm. Make use of Dijakstra’s algorithm.
Traffic is less. Traffic is more.
Converges slowly i.e, good news spread fast and bad news spread slowly. Converges faster.
Count of infinity problem. No count of infinity problem.
Persistent looping problem i.e, loop will be there forever. No persistent loops, only transient loops.
Practical implementation is RIP and IGRP. Practical implementation is OSPF and ISIS.

Next Article

Similar Reads