Distance vector routing protocols measure the best route to
use based on the lowest hop count. The hop count is increased by one for every
router between the source and the destination. With distance vector routing
protocols, the route with the lowest hop count is typically selected as the
destination path for the data.
The
distance-vector routing protocol algorithm passes complete routing table
contents to neighboring routers, which then combine the received routing table
entries with their own routing tables to complete the router’s router table.
This is called routing by rumor, because a router receiving an update from a
neighbor router believes the information about remote networks without actually
finding out for itself.
It’s
possible to have a network that has multiple links to the same remote network,
and if that’s the case, the administrative distance of each received update is
checked first. If the AD is the same, the protocol will have to use other
metrics to determine the best path to use to that remote network. Example of
distance-vector routing protocol is RIP and IGRP.
No comments:
Post a Comment