11解决路由环路机制.pptVIP

* Purpose: This figure describes a corrective measure that attempts to solve the routing loop problems that a distance vector protocol could face. Emphasize: Routing loops occur only when routing knowledge being propagated has not yet reached the entire internetwork—when the internetwork has not converged after a change. Fast convergence minimizes the chance for a routing loop to occur, but even the smallest interval leaves the possibility open. To avoid prolonging the count-to-infinity time span, distance vector protocols define infinity as some maximum number. This number refers to a routing metric, such as a hop count. With this approach, the routing protocol permits the routing loop until the metric exceeds its maximum allowed value. This example shows this defined maximum as 16 hops. Once the metric value exceeds the maximum, network 10.4.0.0 is considered unreachable. * Purpose: This figure introduces the corrective measure known as “split horizon.” The split horizon technique attempts to solve routing loops. Emphasize: The split horizon technique attempts to eliminate routing loops and speed up convergence. The rule of split horizon is that it is never useful to send information about a route back in the direction from which the original packet came. In the example: Router C originally announced a route to network 10.4.0.0 to router B. It makes no sense for router B to announce to router C that router B has access to network 10.4.0.0 through router C. Given that router B passed the announcement of its route to network 10.4.0.0 to router A, it makes no sense for router A to announce its distance from network 10.4.0.0 to router B. Because router B has no alternative path to network 10.4.0.0, router B concludes that network 10.4.0.0 is inaccessible. In its basic form, the split-horizon technique simply omits from the message any information about destinations routed on the link. This strategy relies either on routes never being announced or on old announceme