ccna 200 301 syllabus of errors democracy now today's show

ccna 200 301 syllabus of errors democracy now today's show.R2 goes up to 1.1.1.0/24 1.1.2.1 on the number RIP process summarizes the network 1.1.1.0/24 into 1.0.0.0/8 announced to R2,R2 onHow are the packets forwarded according to1.00.0^8 If there is a packet going to 1.1.2.1, R2 will forward the packet to Rl, R1Figure 7-1-4 Empty Interface Summary Routing There is no explicit route for 1.1.2.1 on the advantage because R1 is using classless routing behavior, R1 will forward packets going to 1.121 to R2,then R2 will forward them to R1,the routing loop is formed according to the default route. If R1 is running the EIGRP protocol, R2 forwards the packets to Rl, and R1 queries the local routing table to know that in addition to the default route, there is a 1.0.0.0/8 route to the null interface that matches 1.1.2.1, and according to the first principle of routing, the longest match takes precedence, and the packets to 1.121 will be sent to the null interface, which means they will be dropped and no routing loops. With the explanation here, I believe the reader has understood the benefit of EIGRP automatically generating summary routes to the empty interface. Next, look at the fourth row of the R1 routing table "D 2.0.0.0/8 [90/156160] via 21.1.1.2, 00:02:41, FastEthemetO/O,^ , where the "D" indicates that the route was learned through the EIGRP protocol. "2.0.0.0/8" is the summary route sent by R2; "[90/156160]" indicates that this route has an administrative distance of 90,metric 156160,EIGRP (the calculation of the metric will be described later). "via21.1.1.2" indicates that the next hop for R1 to 2.0.0.0/8 is 21.1.1.2: "00:02:41" is the time at which this route exists; " FastEthemetO/O" is the outgoing interface of this router. From this routing table, you can see that R1's route to 2.0.0.0/8 goes over the fast Ethernet link, unlike RIP which is simply load balanced based on hop count.3,Topology TableThe topology table is generated by the protocol-related modules. EIGRP uses the DUAL algorithm to calculate, based on the information provided by the neighbor and topology tables, the lowest cost route to eachdestination with the lowest cost route. By keeping track of this information, EIGRP routers can quickly determine and switch to alternative routes.The EIGRP router maintains for each configured routed protocol (e.g., IP, IPX, etc.) a a topology table. This table includes the router's learnedroute entries for all destinations, and all routes learned to a destination are maintained in the topology table. On router R1, use the "show ipeigrptopology" command on router R1 to see the topology table of R1, which is displayed as follows.