Difference between revisions of "Anank5 ccnp 1"
| Line 9: | Line 9: | ||
link-state database (LSDB) - The LSDB is used to calculate the best paths through the network. Link-state routers find the best paths to a destination by applying Dijkstra’s algorithm, also known as the Shortest Path First (SPF) algorithm, against the LSDB to build the SPF tree. | link-state database (LSDB) - The LSDB is used to calculate the best paths through the network. Link-state routers find the best paths to a destination by applying Dijkstra’s algorithm, also known as the Shortest Path First (SPF) algorithm, against the LSDB to build the SPF tree. | ||
| + | [[Image:RoutertypesOSPF.png]] | ||
3.2 Review of OSPF Operation | 3.2 Review of OSPF Operation | ||
Revision as of 15:52, 9 February 2009
CCNP 1
3.1 Review of OSPF Fundamentals and Features
link-state advertisement (LSA) - When a link-state changes, the device that detected the change creates a link-state advertisement
link-state database (LSDB) - The LSDB is used to calculate the best paths through the network. Link-state routers find the best paths to a destination by applying Dijkstra’s algorithm, also known as the Shortest Path First (SPF) algorithm, against the LSDB to build the SPF tree.
3.2 Review of OSPF Operation
3.3 Implementing and Verifying OSPF
3.4 OSPF Network Types
3.5 Implementing OSPF in an NBMA Network
3.6 Multiarea OSPF Operation
3.7 Stub, Totally Stubby, and Not-So-Stubby Areas
3.8 Virtual Links
3.9 Route Summarization
3.10 OSPF Authentication
3.11 OSPF Lab Exercises