Interested to Buy Any Domain ? << Click Here >> for more details...
What is the routing algorithm used by RIP and IGRP?
A.) OSPF
B.) Link-state
C.) Dynamic
D.) Distance Vector
- 4 Answers
- 25028 Views
- I also Faced
- E-Mail Answers
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
Mention what is the matric of eigrp protocol?
What is the difference between half duplex and full duplex?
How many types of ips?
Which command we give for see routing table?
What does data packets consist of?
What we called 64 bit mac-address in ipv6?
Does a bridge divides a network into smaller segments?
what command you must use if you want to delete or remove the configuration data that is stored in the NVRAM?
On which base distance vector choose best path?
What is the name of best path in eigrp protocol?
What is EIGRP?
Define the virtual channel?
Why do you use ‘service password encryption’?
What is a network subnet?
In eigrp metric parameters which 2 options are enable by default?
