ccna 200 301 syllabus plural of

ccna 200 301 syllabus plural of.. Fast Convergence (Convergence):Routing convergence is the state in which all routers in a routing domain agree on the current network structure and route forwarding. Convergence time is the time it takes from the time a change in the network topology occurs until all relevant routers on the network are aware of the change and make outgoing changes accordingly. When a network event causes a route to become available or unavailable, the router sends an update message. The routing update information is spread throughout the network, triggering a recalculation of the best path and eventually reaching a consensus best path among all routers. Slow converging routing algorithms can cause path loops or network outages.. Flexibility: Routing algorithms can quickly and accurately adapt to a variety of network environments. For example, if a network segment fails, the routing algorithm should be able to quickly detect the failure and select another optimal path for all routes using that segment.1.Distance Vector Routing ProtocolDistance vector routing algorithm periodically sends a copy of the routing table from one router to another. These periodic updates between routers exchange routing information and changes in the network. Distance vector based routing algorithms are also known as Bellman-Ford algorithms. RIP and IGRP are both distance vector routing protocols that periodically send the entire routing table to directly adjacent routers. EIGRP is also a distance-vector routing protocol, but EIGRP is an advanced distance-vector routing protocol that also has many of the characteristics of a link-state routing protocol.149/(1) Distance Vector Routing Protocol Routing Loop Formation. Routers performing distance vector routing protocols have no exact information about the far-end network and knowledge of the far-end router, and the way routers performing distance vector routing protocols are informed about the network is through copies of routing tables from neighboring routers, sometimes referred to as distance vector routing protocols as anecdotal routing protocols, hearsay, and not audited, and of course distance vector routing protocols have no way to be audited because they have no exact information about the remote network and routers, which makes it extremely easy to form loops.Here's a look at how routing loops are formed in distance vector routing protocols. In Figure 5-5-1, Router A sends the route for Network 1 to Router B. Router B learns Network 1 and marks the metric as 1 hop, which means it is reachable after one router, and the next hop router is A. Router B sends the route for Network 1 to Router C and Router E. Both Router C and Router E learn Network 1 and mark the metric as 2 hops, which means it is reachable after two routers. The next hop router is B; Router C and Router E both send the route of Network 1 to Router D, Router D has also learned the network chances and marked the metric value as 3 hops, that is, after three routers can be reached, the next hop router is C or E, that is, from two routers can be reached, Router D to Network 1 data will be load balanced. At this point all routers have consistent awareness and correct routing tables, and the network is said to have converged at this point.Router B also sends the learned Network 1 to Router A. Router A finds that Network 1 is a direct route with a smaller administrative distance (0 for direct, 120 for RIP), and Router A does not receive the route from Router B. Similarly, Router C sends the learned Network 1 to Router B. Router B finds that the learned Network 1 from Router A has 1 Router B finds that the network 1 learned from Router A has 1 hop and the network 1 learned from Router C has 3 hops, Router B will not receive the route from Router C for network 1; similarly, all routers will learn the correct route.Before the failure of network 1, router D has two paths to network 1, through C or E to B,and finally to network 1 to which A is connected.When network 1 is disconnected, router A spreads the information about the unreachability of network 1 to network B, and B spreads the information about the unreachability of network 1 to networks C and E. At this point, D does not know that network 1 is not reachable, and at this point D sends an update to E, thinking that network 1 can be reached through C. Of course, it is also possible that D sends an update to C, thinking that network 1 can be reached through E. Network 1, which is discussed here under the previous assumption.