Split horizon rule: Difference between revisions
Jump to navigation
Jump to search
imported>Howard C. Berkowitz (Placeholder from RIP mentioning split horizon; drawing diagrams) |
John Leach (talk | contribs) m (Text replacement - "Border Gateway Protocol" to "Border Gateway Protocol") |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
{{TOC|right}} | {{TOC|right}} | ||
In [[routing protocol]]s, the '''split horizon rule''' states that a [[router]] must not readvertise a route to the router from which a route was first learned. It is a means of preventing loops from forming, and is used with distance vector protocols such as [[Routing Information Protocol]] (RIP) and the [[Interior Gateway Routing Protocol]], and the path vector protocol, | In [[routing protocol]]s, the '''split horizon rule''' states that a [[router]] must not readvertise a route to the router from which a route was first learned. It is a means of preventing loops from forming, and is used with distance vector protocols such as [[Routing Information Protocol]] (RIP) and the [[Interior Gateway Routing Protocol]], and the path vector protocol, Border Gateway Protocol. | ||
==Distance vector== | ==Distance vector== | ||
===General case=== | ===General case=== | ||
Revision as of 14:00, 20 March 2024
In routing protocols, the split horizon rule states that a router must not readvertise a route to the router from which a route was first learned. It is a means of preventing loops from forming, and is used with distance vector protocols such as Routing Information Protocol (RIP) and the Interior Gateway Routing Protocol, and the path vector protocol, Border Gateway Protocol.
Distance vector
General case
Poisoned reverse
"If two routers have routes pointing at each other, advertising reverse routes with a metric of 16 will break the loop immediately. If the reverse routes are simply not advertised, the erroneous routes will have to be eliminated by waiting for a timeout. However, poisoned reverse does have a disadvantage: it increases the size of the routing messages."[1]
Nonbroadcast multiaccess case
Path vector
References
- ↑ G. Malkin (November 1996), Routing Information Protocol, Version 2, Internet Engineering Task Force