ccna 200 301 syllabus plural form of nouns

ccna 200 301 syllabus plural form of nouns.2 If, before the suppression timer expires, an update is received from another neighboring router with a better metric than the previous route, for example, if the hop count of a route previously learned via RIP was 3, and the update message received now indicates that the hop count of that route is 2, then that router identifies this network as reachable and removes the suppression timer.3 If an update is received from another neighboring router before the suppression timer expires and has the same or worse metric than the previous route, for example, the hop count of a route previously learned via RIP was 3, and the update message received now indicates that the route has a hop count of 3 or 4, the update is ignored.4 After the suppression timer period expires, the suppression timer is deleted and any updates that have a legal metric value are received.2.Link State Routing ProtocolLink-state routing protocols are also known as shortest path first protocols, the algorithm used in link-state routing protocols is the Shortest Path First (SPF) algorithm, sometimes called Dijkstras algorithm. Link-state routing protocols generally maintain three tables: a neighbor table, which keeps track of directly connected neighboring routers; a topology table, which holds a database of topological information about the entire network; and a routing table, which maintains routing information. The link-state routers maintain all the information about the remote routers and their interconnections, and the routing algorithm performs the SPF algorithm based on the topology database, which makes the link-state routing protocol less prone to routing loops.Table 5-5-3 compares distance vector routing protocols with link-state routing protocols.Table 5-5-3 Comparison of Distance Vector Routing Protocol and Link State Routing ProtocolDistance Vector Routing Protocols Link State Routing ProtocolsTechnical requirements for configuration and maintenance Moderate requirements for administrators Requires more comprehensive knowledge of administratorsRequires resources such as CPU, bandwidth, and memory to Not require a lot of memory to store information or a good CPU to perform calculations If the routing table is large, periodic updates can take up some bandwidth Thin Requires a lot of memory to store neighbor and topology information and a good CPU to perform SPF algorithms Incremental updates, not much bandwidth intensive