Revision as of 16:39, 13 April 2022 edit Jorjulio (talk \| contribs) 207 edits m In the introduction, fourth sentence of first paragraph, changed "routers, on which a distance-vector protocol is implemented," to "routers using a distance-vector protocol". Also, in the same paragraph, last sentence, changed "informs" to "inform". ← Previous edit		Revision as of 08:14, 15 April 2022 edit undo Dandorid (talk \| contribs) Extended confirmed users 4,434 edits m →Workarounds and solutions: Ref rfc1058 Next edit →
Line 31: ===Workarounds and solutions=== [[Routing Information Protocol\|RIP]] uses the [[Split horizon route advertisement\|split horizon]] with poison reverse technique to reduce the chance of forming loops and uses a maximum number of hops to counter the 'count to infinity' problem. These measures avoid the formation of routing loops in some, but not all, cases.~~<ref>~~{{~~IETF~~Ref RFC\|1058~~}}, Section~~ \|section=2.2.2~~</ref>~~}} The addition of a ''hold time'' (refusing route updates for a few minutes after a route retraction) avoids loop formation in virtually all cases, but causes a significant increase in convergence times. More recently, a number of loop-free distance vector protocols have been developed — notable examples are [[EIGRP]], [[DSDV]] and [[Babel (protocol)\|Babel]]. These avoid loop formation in all cases, but suffer from increased complexity, and their deployment has been slowed down by the success of [[link state routing protocol]]s such as [[OSPF]].

Distance-vector routing protocol: Difference between revisions