ccna 200 301 syllabus plural form of moose

ccna 200 301 syllabus plural form of moose.Convergence time With periodic updates, convergence time is slow, sometimes even takes a few minutes Triggered updates, convergence time is fast, . Typically within a few secondsRouting loops Slow convergence is prone to inconsistent routing tables across routers, making it easy to generate loops Based on a network-wide topology database, the SPF algorithm is implemented, making it less likely to generate routing loopsScalability Slow convergence and flat design limit the size of the network, which cannot be very large Fast convergence and hierarchical design, the network can be very large5.5.5 Common routing protocols*Several common dynamic routing protocols are described here.1. RIPRIP (Routing Information Protocol) is the oldest routing protocol in the Internet. RIP uses distance vector algorithm, i.e. routers select routes based on distance, so it is also known as distance vector protocol. The router collects all the different paths to the destination and keeps information about the minimum number of sites (hop) to reach each destination and discards any information other than the best path to the destination. At the same time, the router also informs the other neighboring routers about the collected routing information using the RIP protocol. In this way, the correct routing information is gradually spread throughout the network.RIP is simple and easy to configure. However, RIP is only suitable for small networks because the maximum number of hops it allows is 15, and any destination with more than 15 sites is marked as unreachable. Also, RIP broadcasts routing information every 30 seconds152The frequent updates also affect the performance of the router. RIP routing protocols are slow to converge and sometimes cause loops in the network. Chapter 6 of this book will introduce the RIP protocol. 2.