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
Can you explain different components in PKI?
Define bandwidth?
What is the name of best path in eigrp protocol?
Explain types of communication in ipv4?
How are internetworks created?
What is hold down time formula of ospf?
Explain the term 'multicast'.
Referring to the commands shown, what command must next be used on the branch router prior to traffic being sent to the router?
What is mac address size of ipv6?
Explian what is a node?
Can yo define LNS
Which reserve port no http use?
What is subnet? Why is it used?
How many hope count rip or rip2 can send updates?
Explain the term 'unicast'.