Copyright 2003 CCNA 3 Chapter 3 Single-Area OSPF By Your Name
Copyright 2003 Objectives Link-state routing protocol Single-area OSPF concepts Single-area OSPF configuration
Copyright 2003 Overview of Link-State and Distance Vector Routing
Copyright 2003 Link-State Routing Features Respond quickly to network changes Send triggered updates only when a network change has occurred Send periodic updates known as link-state refreshes Use a hello mechanism to determine the reachability of neighbors
Copyright 2003 How Routing Information Is Maintained
Copyright 2003 Link-State Routing Algorithms
Copyright 2003 Advantages and Disadvantages of Link-State Routing
Copyright 2003 Comparing Distance Vector and Link-State Routing
Copyright 2003 Single-Area OSPF Concepts
Copyright 2003 OSPF Overview OSPF is becoming the preferred IGP protocol when compared with RIPv1 and RIPv2 because it is scalable.
Copyright 2003 OSPF Terminology
Copyright 2003 Comparing OSPF with Distance Vector Routing Protocols
Copyright 2003 Shortest Path Algorithm The best path is the lowest-cost path.
Copyright 2003 OSPF Network Types
Copyright 2003 OSPF Hello Protocol
Copyright 2003 Steps in the Operation of OSPF
Copyright 2003 Single-Area OSPF Configuration
Copyright 2003 Configuring the OSPF Routing Process
Copyright 2003 Configuring OSPF Loopback Address and Router Priority
Copyright 2003 Configuring Router Priority The priorities can be set to any value from 0 to 255. A value of 0 prevents that router from being elected. A router with the highest OSPF priority will win the election for DR.
Copyright 2003 Modifying OSPF Cost Metric
Copyright 2003 Configuring OSPF Authentication
Copyright 2003 Configuring OSPF Timers
Copyright 2003 OSPF, Propagating a Default Route
Copyright 2003 Common OSPF Configuration Issues
Copyright 2003 Verifying OSPF Configuration show ip protocol show ip route show ip ospf interface shop ip ospf show ip ospf neighbor detail show ip ospf database
Copyright 2003 The debug and clear Commands for OSPF Verification