0
I am not too good with the details yet but here is what I know...
In the distance vector routing algorithm, when the link cost for any link drops this good news travels very fast. But when the link cost for any link increases, this bad news takes many iterations of the algorithm to travel. This problem that the distance vector algorithm has with propagation of bad news is called the count to infinity problem. When I learn more about the details of this, I would come back to this page and add more details.
oh btw, I found this great link for a short explanation See related links
You might also want to check out poison-reverse and horizon-splitting
What else can I help you with?
Which technology can be used in distance vector routing protocols to prevent routing loops?
Which two technologies can be used in distance vector routing protocols to prevent routing loops?
When should distance vector routing be used?
Distance vector routing is used when the network is simple and has no hierarchical design. Examples of distance vector routing protocols are RIP and IGRP.
Which two technology can be used in distance vector routing protocol to prevent routing loop?
Which two technologies can be used in distance vector routing protocols to prevent routing loops?
Which two technologies can be used in distance vector routing protocols to prevent routing loops?
Which two technologies can be used in distance vector routing protocols to prevent routing loops?
What are the characteristics of a distance vector routing protocol?
Two Characteristics: RIP is an example of distance vector routing protocols. Updates are periodic and include the entire routing table
What is Distance Vector protocols?
Distance vector protocols are routing protocols that use the distance and direction to a destination network to make routing decisions. Examples include RIP (Routing Information Protocol) and EIGRP (Enhanced Interior Gateway Routing Protocol). These protocols share routing information with neighboring routers and update their routing tables based on the information received.
What three routing protocols are distance vector routing protocols?
Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) are two very popular Distance Vector routing protocols
What happens after 15 hops for rip routing method?
what happens in RIP ROUTING method after the 15 hop
What is the name of the distance vector routing protocol for Apple Talk?
RTMP- Routing Table Maintenance Protocol.
Explain any two dynamic routing algorithms?
Dynamic or adaptive Routing algorithms in contrast change their routing decisions to reflect changes in topology and usually the traffic as well Dynamic routing attempts to solve this problem by constructing routing tables automatically, based on information carried by routing protocols, and allowing the network to act nearly autonomously in avoiding network failures and blockages. Dynamic routing dominates the Internet. However, the configuration of the routing protocols often requires a skilled touch; one should not suppose that networking technology has developed to the point of the complete automation of routing.
Which routing protocol has the most trustworthy administrative distance by default?
generally static routing protocol has the most trustworthy administrative distance .i.e; 1 and in dynamic routing protocols EIGRP has the best AD.
What best describes the operation of distance vector routing protocols?
They send their routing tables to directly connected neighbors.
