Terms : Hide Images
| 8721605149 | 1. data structures - routing tables 2. messages (incoming & outgoing on interfaces) - to discover neighboring routers, exchange router info, and learn about remote networks with other routers using the same routing protocol 3. when a router detects a topology change the routing protocol advertises this change to other routers 4. algorithm - steps used to complete a task and determining the best path | What are the 4 main components of dynamic routing protocols? | 0 | |
| 8721610478 | 1. the router applies configuration stored in NVRAM & discovers its own directly connected networks 2. next, the routing table is updated with all directly connected networks and the interfaces those networks reside on 3. if a routing protocol is configured, the router begins exchanging routing updates to learn about any remote networks 4. the router sends an update packet out all enabled interfaces (contains routing table) and at the same time, the router receives and processes similar updates from other connected routers 5. when the router receives the updates, it checks the updates for new network info to add networks that aren't already listed into the routing table 6. another exchange of routing information gives routers full knowledge about a converged network | When a router powers up, it does not even know that there are devices on the other end of its links. What happens next? | 1 | |
| 8721616145 | distance vector routing protocols implement a routing loop prevention technique which prevents information from being sent out the same interface in which it was received | What is a split horizon? | 2 | |
| 8721619384 | 1. speed of propagation of routing info - amount of time routers take to forward routing info 2. calculation of optimal paths | What are 2 convergence properties? | 3 | |
| 8721624074 | * Distance - how far to the destination network - based on metrics like hop count, cost, bandwidth, delay, etc. * Vector - the direction of the next-hop router or exit interface to reach the destination | What 2 characteristics does a distance vector use to advertise? | 4 | |
| 8721634478 | 1. sending & receiving updates 2. calculate and install the best path 3. detect and react to topology changes | What is the purpose of algorithms for distance vector routing protocols? | 5 | |
| 8721637965 | Both use hop count metric - maximum # of hops is 15. RIPv1 - updates go to 255.255.255.255 RIPv2 - updates go to multicast 224.0.0.9 Only RIPv2 supports VLSM, CIDR, Summarization, and Authentication. | Compare/Contrast RIPv1 and RIPv2: | 6 | |
| 8721644758 | 1. router builds topological map of network to determine the shortest path 2. faster convergence achieved by immediate flooding of LSPs 3. LSPs only sent when topology changes 4. hierarchical design | List 4 advantages of Link-State Routing Protocols: | 7 | |
| 8721649181 | 1. database & SPF tree uses memory 2. calculating SPF algorithm uses CPU 3. LSP flooding adversely affects bandwidth 4. requires a lot of hardware resources | List 4 overhead disadvantages of Link-State Routing protocols: | 8 | |
| 8721653470 | 1. level 1 Ultimate network route 2. level 2 child route of a level 1 parent route 3. level 1 supernet 4. default route 5. if no match is found - packet is dropped | When a packet arrives on a router interface, in what order does the router choose a route to forward the packet? | 9 |
