What is the difference between Link state routing and distance vector routing through examples?

Answer 1

In a distance vector routing protocol, such as RIP or EIGRP, each router sends its routing table to neighboring routers. The routers don't know the topology, i.e., how other routers are interconnected.

In a link state routing protocol, such as OSPF or IS-IS, routers first exchange information about connections within the network (or an area of the network), and build a topology table. Then each router uses Dijkstra's algorithm to calculate the best route to each destination.

Answer 2

The link state protocol can identify when when a destination can be reached through faster connections, even if it is more hops than other possible routes. Distance vector will pick the route with the lowest hop count.

by Nelson Thoms

Answer 3

Distance vector routing relies on the distance between networks as its cost metric (number of hops).

Link state routing uses a number of different factors to calculate the cost between networks, including the distance of the link, speed of the link, type of the link, type of routers, amount of traffic, etc.

Answer 4

Distance vector routing is an older routing protocol that uses the shortest path regardless of speed to go from point A to point B.

Link state routing examines the speeds of the paths, and then chooses the fastest path to reach a destination.

Basically, if all speeds on a routing network are equal, distance vector would be better because its an older technology and costs less.

More info can be found: http:/wwwzperiodzinetdaemonzperiodzcom/tutorials/internet/ip/routing/dv_vs_lszperiodzshtml


in addition to the above answer i would like to include that.. distance vector routing is used in RIP(Router Information Protocol).
Whereas the link state routing is used in OSPF(OpenShortest Path First).

Answer 5

A distance vector routing protocol calculates the best path based on hop count. An example would be the RIP protocol. A link-state protocol takes into account the entire topology and uses link cost to determine a best path based on cost rather than hop count. A good example of a link-state protocol is OSPF.

Answer 6

An advantage would be that the link-state changes dynamically between two points and the cost metric can be recomputed as a result. The distance vector algorithms are more static in nature and once the cost metric for a hop is calculated no other external events are taken into account.

Answer 7

The distance vector routing protocol and link state routing protocol both are in dynamic routing protocol.

The distance vector routing protocol uses no. of hops for the finding the best route while link state routing protocol uses bandwidth (cost) of the link for the finding best route .

The cost will be calculated by [10(8)/bandwidth of the link]

Distance vector routing has limited hop count

Link state routing has unlimited hop count.

The RIP ,IGRP fall under category of distance vector routing protocol.

while

OSPF is of link state routing protocol.

Hitesh Pardeshi

Answer 8

There are several, and it would be useful to study the details of how each general type of routing protocol works.

• A router using a distance vector routing protocol doesn't know anything about the topology of the network (how other routers are interconnected). With a link-state routing protocol, they do.
• A distance-vector routing procotols sends updates about the routing table. A link-state routing protol sends topology information.
• In a distance-vector routing protocol, the distances (metrics) are added when the routes are sent from one router to another. The router can then choose the route with the best metric to any network. In a link-state routing protocol, instead, each router calculates the best route (to a specified network) based on the topological information it has.