| A | B |
|---|
| Convergence | All routers have same knowledge of structure and topology |
| Network | Part of IP address used for path determination |
| Neighbors | Routers that exchange information using distance-vector protocol |
| Periodic updates | Required from distance-vector algorithms |
| Hold-down timers | Prevents count to infinity |
| Network address | Used to identify the destination LAN |
| OSPF | Maintains a complex database of topology information using LSA's |
| Automatic adjustments | Advantage of dynamic routing |
| Split horizon | Prevents information from exiting router on same interface that it entered |
| EIGRP | A hybrid routing protocol |
| 3 | OSI layer for path determination |
| Link-state | Routing protocol describing OSPF |
| Default | Kind of route set when the next hop is not listed in the table |
| Link-state algorithms | Enables each router to know exact topology of the network |
| Hop | Measure the passage of a data packet through a router |
| Bandwidth, load, and reliability | Metrics commonly used by routers to evaluate a path |
| Stub network | Network with only one path to a router |
| Unreachable | Routers have different set of LSA's |
| Topology changes | Triggers link-state routing updates |
| Routing loop | When packets cycle repeatedly through the same group of nodes |
| Reveal everything | Disadvantage of dynamic routing |
| Manual updates | Disadvantage of static routing |
