ccnp 300-135 drag and drop

ccnp 300-135 drag and drop

Second layer bundling Longest matching principle Automatic summary Corresponding hwidb fast_if_number 4 Corresponding hwidb firstsw->if_number 4 Internet address is 10.1.12.2/24 32 bits Update-source Neighbor 10.1.23.2 remote-as 200 neighbor 10.1.23.2 route-map test in Router bgp 64512 Set interface switchport trunk encapsulation dot1q switchport mode trunk AFI ( Address Verify again, instead of detailed routing, use a summary route of ip route 10.0.0.0 255.0.0.0 , the next hop is R3 , the effect is the same as above, also take R3 . Therefore, as long as it is not the default route, as long as there is such a matching route in the routing table, the route is taken preferentially, and the route-map is taken without the route . Half-life: 15 minutes As shown above, R1 , R2 , and R3 run RIP . In the initial situation, R2 will update its routing table to R1 , which assumes that there are three routes 1.0 , 0.0.0.0 Local The configuration of R2 is as follows: The default bridge priority of the switch is increased to a higher value than the default ( 32768->49152 ) so that the switch does not become Root. One solution is that SW1 does not insert opiton82 , another method is to use the configuration on the DHCPserver : If an interface is in the flooding state, it will bring a lot of upadate and witdhdrawn messages to the network . Therefore, for a flipped interface, no bgp fast-external-fallover is recommended . After the interface is shut down, the BGP session and neighbor relationship will remain until Routers can learn routing entries in a variety of ways: static manual configuration, various dynamic routing protocols, and more. When the router learns two routes to the same destination from two different ways,ccnp 300-135 drag and drop, the router compares the AD values ​​of the two routes , that is, the management distance, preferably the route with a small AD value. If the AD values ​​are equal, for example, the same routing protocol, the metric value is further compared . Of course, this also involves the working mechanism problem of different routing protocols, which is specifically discussed for different routing protocols. As shown in the following figure, R3 and R1 run the RIP protocol, and R3 establishes adjacency relationship with R2 through OSPF . Therefore, R3 learns the route to the destination 1.1.1.0/24 from RIP and OSPF . The two routes use R1 and R2 as the next hop respectively. Then R3 finally chooses the OSPF route to be loaded into the routing table, which is to use R2 as the actual destination.