1
19kviews
Compare between Distance Vector Algorithm and Link State Routing Algorithm.
1 Answer
2
2.0kviews
Distance Vector Routing Link State Routing
Distance vector protocols use a distance calculation plus an outgoing network interface (a vector) to choose the best path to a destination network Link State protocols track the status and connection type of each link and produces a calculated metric based on these and other factors, including some set by the network administrator
Each router maintains routing table indexed by and containing one entry for each router in the subnet It is the advanced version of distance vector routing
Algorithm took too large to converge Algorithm is faster
Distance Vector routing protocols support dis-contiguous subnets Link State routing protocols support contiguous subnets
Distance Vector routing protocols uses hop count and composite metric Cost is the metric of the Link State routing protocols
Bandwidth is less Wide bandwidth is available
Router measure delay directly with special ECHO packets All delays measured and distributed to every router
It doesn’t take line bandwidth into account when choosing the routes It considers the line bandwidth into account when choosing the routes
Distance Vector routing protocols are less scalable such as RIP supports 16 hops and IGRP has a maximum of 100 hops Link State routing protocols are very much scalable; supports infinite hops
Distance vector require less memory Link state require more memory
Please log in to add an answer.