Explain difference between distance vector and link state routing.
Distance Vector Routing
|
Link State Routing
|
Routing tables are updated by exchanging information with the neighbours.
|
Complete topology is distributed to every router to update a routing table.
|
It update full routing table.
|
It updates only link states.
|
It uses Bellman-Ford algorithm
|
It uses Dijkstra algorithm.
|
Distance Vector routing doesn‟t have any hierarchical structure.
|
Link state routing works best for hierarchical routing design.
|
CPU and memory utilization is lower than Link state routing.
|
Higher utilization of CPU and memory than distance vector 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.
|
Example protocols are RIP and IGRP.
|
Example protocols are OSPF and IS-IS.
|
Slow convergence.
|
Fast convergence.
|
Summarization is automatic
|
Summarization is manual.
|
Easier to configure
|
Harder to configure
|
Count to infinity problem
|
No count to infinity problem
|