What is the routing algorithm used by RIP and IGRP?
A.) OSPF
B.) Link-state
C.) Dynamic
D.) Distance Vector
Answer Posted / guest
Answer: D
Distance vector-based routing algorithms (also known as
Bellman-Ford
algorithms) pass periodic copies of a routing table from
router to
router. Regular updates between routers communicate topology
changes.
Each router receives a routing table from it's direct
neighbor and
increments all learned routes by one. By this method, each
router learns
the internetwork topology via second hand information.
| Is This Answer Correct ? | 36 Yes | 3 No |
Post New Answer View All Answers
Which reserve port no http use?
What metric does rip use? How is the metric used to indicate an unreachable network?
Explain the types of communication in ipv6 ?
In eigrp metric parameters which 2 options are enable by default?
Which table find best path?
Explain the difference between flsm and vlsm?
How many hop counts are by default and how much you can increase in eigrp protocol?
what does the clock rate do?
Which dynamic type draw back is, if single link down, it removes its routing table?
What causes a triggered update to reset the router hold-down timer?
What is de-encapsulation?
What command do we give if router ios is stucked?
What is osi reference model?
What is BootP?
What is cam?