0
What metric does the RIP routing protocol consider to be infinity?
Wiki User
∙ 13y ago
16
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
What does a distance vector routing protocol let a router know about remote networks?
The availability of networks, and the metric (or "cost" or "distance") to reach them, according to the system used by the routing protocol to calculate this "metric".The availability of networks, and the metric (or "cost" or "distance") to reach them, according to the system used by the routing protocol to calculate this "metric".The availability of networks, and the metric (or "cost" or "distance") to reach them, according to the system used by the routing protocol to calculate this "metric".The availability of networks, and the metric (or "cost" or "distance") to reach them, according to the system used by the routing protocol to calculate this "metric".
Which routing protocol uses hop count as the metric?
RIPv1 RIPv2
Which mechanism helps to avoid routing loops by advertising a metric of infinity?
route poisouning
How does route poisoning prevent routing loops?
Failed routes are advertised with a metric of infinity.
Which routing protocol by default uses bandwidth and delay to calculate the metric of a route?
EIGRP
What is true about the metrics used by routing protocols?
A metric is a value used by a particular routing protocol to compare paths to remote networks.
What allows RIP to avoid routing loops by advertising a metric of infinity?
Split horizon with poison reverse.
When rip is used in routing protocol which metric is used to route information across the network from location to location?
A hop. :)
What are the four key issues in dynamic routing protocol?
Path determilnation, metric convergenence and load balancing
How do you calculate metrics?
Hop count & administrative distance. This is a measure used by the routing protocol to calculate the best path to a given destination, if it learns multiple paths to the same destination. Each routing protocol uses a different metric.
What is the difference between Link state routing and distance vector routing through examples?
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.
What is the method that a routing protocol uses to determine the best route to a destination network?
It depends on the routing protocol in use, for example RIP uses the hop-count to determine the best route where less hops is better, OSPF uses cost, EIGRP uses a composite metric (BW + Delay + Reliability + Load) etc.
