ccnadesde 0

ccnadesde 0.autonomous system, what is administrative distance, and what is a metric value. Keep in mind the administrative distances of the various IP routing protocols to be able to determine the distance to the same destination that multiplerouting protocols are informed of routes to the same network, which one will appear in the routing table.Dynamic Route-Out Selection ProtocolsKeep in mind the various metric values used by routing protocols. Be familiar with how distance vector protocols using the Bellman-Ford algorithm work and know the characteristics of distance vector protocols and link state protocols. Know how link-state protocols use LSAs to do their job and how to create routing tables.Problems with distance vectoring protocols and their solutions Understand the problems with distance vectoring protocols and their solutions. Understand how to look at routing tables to find routing loops and know the solutions to routing loop problems: hop limits, horizontal splits, suppression timers, suppressed routes, and reverse suppression. Be familiar with these terms and their meanings.14.4 Authentication SummaryA router finds out the Layer 3 path to a destination network and exchanges packets from one interface to another, allowing them to travel to the destination. The router learns about neighboring routers, finds out the location of the destination network, chooses the best path, and maintains up-to-date routing information. The protocol being routed is a Layer 3 protocol, such as IP or IPX. routing protocols such as RIP and OSPF define how destinations are found for the protocol being routed. Some routing protocols (such as EIGRP) use autonomous systems ---------------------------------------------------------- groups to unify the managed network. Cisco switches determine which routing protocol learned routes to add to the routing table based on administrative distance: routes learned by the routing protocol with the lowest administrative distance are added to the routing table.There are two routing protocols: static and dynamic. The choice of which dynamic routing protocol should be used takes into account the routing metric value, the way routing information is shared, the convergence time, the way routing information is processed, and the routing overhead. The routing metric value determines what method is used to calculate the overhead to the destination network, for example, RIP uses hop count.Distance vectoring protocols use broadcasts to share routing information and do not verify that neighbors have received routing updates. They use the Bellman-Ford algorithm to process updates with little CPU cycles and memory: updates are received, the metric is increased, the result is compared to the routes already in the routing table, and the routing table is updated as necessary.Link-state protocols use the SPF algorithm to create routing tables, which provides a loop-free topology. They use multicast to share routing information incrementally and verify that neighbors have received this information. Link-state protocols support classless routing and allow you to aggregate the network information in the routing table. The main disadvantage of these protocols is that they require more CPU cycles and memory to process and store routing information. They are also vulnerable to rollover routing problems.