Differentiate between link state and distance vector routing.

Question

Editorial Team · Accepted Answer

Both are dynamic routing algorithms, but they share different information with different routers. Distance vector routing Link state routing Each router shares its whole routing table (its distances to every destination). Each router shares information about its own links (its directly connected neighbours and their costs). Shared only with directly connected neighbours . Flooded to all routers in the network. Updates are sent periodically (e.g. every 30 s in RIP). Updates are sent only when a link changes . Uses the Bellman–Ford algorithm. Each router builds the full topology and runs Dijkstra's shortest path algorithm. Each router knows only the next hop and distance ("routing by rumour"). Each router has a complete map of the network. Slow convergence ; suffers from the count to infinity problem. Fast convergence ; no count to infinity problem. Less CPU and memory needed; simple to configure. More CPU and memory needed; more complex. Suitable for small networks. Suitable for large networks. Examples: RIP , IGRP. Examples: OSPF , IS IS.

Distance vector routing	Link state routing
Each router shares its whole routing table (its distances to every destination).	Each router shares information about its own links (its directly connected neighbours and their costs).
Shared only with directly connected neighbours.	Flooded to all routers in the network.
Updates are sent periodically (e.g. every 30 s in RIP).	Updates are sent only when a link changes.
Uses the Bellman–Ford algorithm.	Each router builds the full topology and runs Dijkstra's shortest path algorithm.
Each router knows only the next hop and distance ("routing by rumour").	Each router has a complete map of the network.
Slow convergence; suffers from the count-to-infinity problem.	Fast convergence; no count-to-infinity problem.
Less CPU and memory needed; simple to configure.	More CPU and memory needed; more complex.
Suitable for small networks.	Suitable for large networks.
Examples: RIP, IGRP.	Examples: OSPF, IS-IS.

Differentiate between link state and distance vector routing.

Discussion

More Computer Networks questions