Breaking News
Home > Tag Archives: Link State

Tag Archives: Link State

Differences between distance vector and link state routing protocol

Differences between distance vector and link state routing protocol

We have already discussed about distance vector and link state routing protocol separately. In this article Differences between distance vector and link state routing protocol we will take a glance of differences between distance vector and link state routing protocols. No doubt, both types of routing protocols have some advantage and disadvantage over each other. In different situation any one of both routing protocol can be implemented.

In the given table you can find differences between distance vector and link state routing protocol

Particular Distance Vector Routing Protocol Link State Routing Protocol
Example of RIP, IGRP OSPF, IS-IS
Algorithm Bellmon-ford Shortest Path first (SPF)
Support subnet Only Classfull Routing Classfull, Classless, VLSM, Summarization
Scale Small, limited hop Large
Table creation Only Routing Table Routing Table, Neighbor Table and Topology Table
Convergence time Very Slow Fast
Updating On Broadcast On multicast
Updating based on Rumor Based on topology table
Updating time When periodic timer expired Whenever changing occurs
Updating contents Whole routing table Only changed information
HOP Limited Unlimited
Needs Memory Less High
CPU Cycle Less High
Configuration Simple Advanced
Risk of Layer 3 Loop Yes No
Hierarchical Structure No Yes
OPEN Standard Yes Yes

I hope you have understood what the Differences between distance vector and link state routing protocol.

Thank you.

Power by

Download Free AZ | Free Wordpress Themes