CCNP Enterprise ENCOR 350-401: OSPF, EIGRP, BGP Routing 2/5

Develop prerequisite knowledge for CCNP Enterprise ENCOR 350-401 part 2, covering connectivity, IP addressing and interface verification, routing concepts, and an introduction to dynamic routing protocols like OSPF and ISIS.

Explore OSPF, a widely used link-state routing protocol, and learn how its shortest path first algorithm uses bandwidth and cost, administrative distance, and load balancing to select the best routes.

Discover how OSPF establishes neighbor relationships with hello exchanges, shares link-state databases, and computes the best routes from metrics to forward traffic with failover.

Learn how OSPF selects the router ID from manual configuration to the highest loopback IP, and how the router ID must be unique within the domain for stable neighbor adjacencies.

Explain how OSPF builds a common link-state database by flooding advertisements after neighbor adjacency, ensuring every router maintains identical topology information across the network.

Analyze how neighbors establish, determine who starts the exchange, and synchronize the link-state databases by exchanging summary information and advertisements to ensure identical LSDBs.

Explain how ospf lsdb synchronization progresses from loading to full state among neighboring routers, exchanging lsas to share a complete database, then use spf to compute the best route.

Learn how neighbor maintenance uses hello packets every 10 seconds, a 40-second convergence timeout, and a mix of incremental and periodic updates every 30 minutes to keep neighbor information synchronized.

Covers OSPF tables, including the database table and the routing table, where routers exchange neighbor information and compute the best routes by bandwidth.

Master OSPF configuration syntax: enter config mode, select OSPF process, and assign a process ID for multiple instances. Advertise networks with address and wildcards; areas will be covered later.

Explore how the OSPF wildcard mask defines which addresses advertise by using zeros to require a match and ones to ignore, with subnet-to-wildcard inverses and practical examples.

Practice setting up a single area OSPF network by ensuring router connectivity and preconfigured IP addresses and interfaces, aligning topology with IP configurations.

Configure ospf single area by selecting two interfaces to advertise, applying subnet masks, and assigning an area id, then verify neighbor relationships across interfaces.

Verify OSPF single-area operation by checking neighbors, IP options, and Schwiebert database; validate interface IPs and the highest IP on physical or loopback, then review routing table and traceroute.

Explore how OSPF advertisements map to interfaces using match patterns, wildcard masks, and specific not conditions to selectively advertise networks across a topology.

Analyze how OSPF builds the link-state database from LSAs, computes least-cost routes using interface costs, and installs the best path into the routing table.

Explores how OSPF cost is derived from interface bandwidth, explains the default bandwidth method and two alternative options to adjust cost values, and how configurations affect routing cost.

Adjust interface bandwidth to match the real link speed, because routing cost depends on the configured bandwidth; verify with interface brief to align values for accurate routing decisions.

Explore the limitations of the default reference bandwidth and how it normalizes costs across fast and slow links, potentially misrouting traffic in mixed-speed networks.

Manually set interface costs to influence routing by configuring cost values on interfaces, overriding the default cost of one; observe how the cost to reach a destination network is recalculated.

Learn to adjust the auto cost reference bandwidth to scale link costs for high-speed interfaces. Use a higher reference or manual costs and verify results across the network.

Explore the limitations of a single OSPF area in large networks and the impact on memory, CPU, convergence time, and routing tables. Learn why dividing into multiple areas improves scalability.

OSPF uses multiple areas to logically group routers, reducing database size and CPU and memory use, with area-local advertisements that enable faster convergence.

Apply design rules for multi-area OSPF, ensuring a backbone area zero, linking non-backbone areas to area zero, and placing border routers to exchange routes with interfaces in matching areas.

Configure multiple areas to segment branch offices from the core, assign interfaces to area 20 for branches and area 23 for core connections, and advertise networks with the wildcard mask.

Explore configuring multi-area OSPF in a CCNP Enterprise ENCOR lab, assigning interfaces to area zero and other areas, managing area mismatches, and verifying neighbors and routing tables.

Explore OSPFv2 interface advertisements, comparing the traditional network statement approach with the interface subcommand, and learn how enabling OSPF on an interface automatically advertises networks in an area.

Explore how OSPF behavior changes with network types, including point-to-point, broadcast multi-access, and non-broadcast multi-access, and how defaults and changes apply to internet and VPN contexts.

Learn how OSPF handles broadcast networks with multiple adjacencies using a designated router and backup designated router to prevent LSA floods, with election and failover.

Discover how DR and BDR elections select designated and backup designated routers by comparing interface property values and priorities, handling ties, and re-election rules.

Verify dr bdr elections in a broadcast backbone network by configuring interfaces, assigning ip addresses, and observing neighbor states.

Learn how OSPF handles point-to-point links versus broadcast networks, and how to configure interfaces to use point-to-point to reduce overhead, with verification steps.

Advertise the default route via IGP to all branches, enabling branch offices to reach the internet through the head office, while avoiding routing loops and scalability issues.

Demonstrate how OSPF default route advertisements push a common default to branch offices from the head office, ensuring consistent connectivity and routing decisions across the network.

Configure and verify OSPF default route advertisements in a lab with head office and branch offices, using static defaults, internet simulation, and basic BGP considerations.

Configure OSPF default route advertisements with the default information option and always keyword, ensuring advertising regardless of routing table presence and adjusting cost and metric.

Explore enhanced interior gateway routing protocol (eigrp) as a Cisco-standard protocol using diffusion update algorithm, multicast discovery, and a bandwidth-based metric with 250 hops and administrative distance 90.

Explore how EIGRP operates as an IGP, from hello-based neighbor discovery to routing-table convergence, where updates propagate via unicast acknowledgments and determine the best paths.

Learn to verify an eigrp process by configuring a job, enabling debug messages, and monitoring neighbor relationships and hello messages every five seconds to confirm routing-table accuracy.

Explore how EIGRP maintains neighbor, topology, and routing tables with incremental updates. Identify how best routes are learned from neighbors, chosen by least cost, and advertised to neighbors.

Explain how EIGRP convergence rapidly switches to an alternate route when a link fails, using periodic hello updates and a feasible successor to ensure fast route convergence.

Discover how eigrp computes the best path using bandwidth, delay, minimum bandwidth, load, and reliability, including k-values, while understanding default versus actual interface bandwidth and when metrics are enabled.

Learn how EIGRP metric path calculation uses bandwidth and delay to compute route cost, with fixed default delays and maximum transmission size not included.

Configure EIGRP with multiple autonomous system instances, advertise networks using wildcard masks, establish neighbors, and verify routing tables, metrics, and load balancing for optimal paths.

Identify the successor as the least-cost best route and the feasible successor as a backup, using routing and topology tables to achieve faster convergence.

Understand feasible distance as the total metric to reach a destination and reporting distance as the neighbor's advertised metric, guiding the best route, feasible successor, and topology table verification.

Explore the EIGRP feasible condition, where a feasible successor is chosen only if the successor distance exceeds the feasible successor's reporting distance, as shown in topology and routing tables.

Explore summarization concepts in routing, showing how combining multiple small subnets into a single larger subnet reduces routing table size and border overhead.

summarization reduces routing table size, saving memory and cpu resources by representing multiple routes with a single summary, while enabling incremental updates and restricted updates to affected routers.

Explore auto and manual summarization in routing, including how default classful boundaries and subnet masks affect summarization. Understand why newer IOS versions disable auto summary to prevent routing conflicts and ensure clear route decisions.

Verify and test auto summarisation in a lab topology, showing how enabling or disabling auto summarisation affects routing tables and interface status.

In CCNP enterprise encor 350-401 part 2, administrators configure manual summarization for specific prefixes and ranges beyond default class boundaries. Apply a four-step calculation to derive optimized summaries.

learn how to calculate a summary address by analyzing binary min and max, separating common and non-common bits, and deriving the slash value for a network.

Identify the common binary bits across the subnets to derive the summary address. The example yields a summarized route of 172.16.0.0/22.

Demonstrate calculating a summary address using example 3, converting binary segments, identifying common left-side parts, and determining the slash value to generate a /21 summary address.

Learn the rules for network summarization by using nearest boundary values, ensuring contiguity, and planning a structured address layout to summarize multiple subnets without exposing in-between addresses.

Learn to perform manual EIGRP summarization on specific interfaces to advertise a single summary route instead of multiple subnets, reducing routing table size and preserving reachability across a topology.

Explore how router summarization creates routes to a null interface to drop unknown destinations and prevent routing loops, using multivolume groups and debug commands.

Explore OSPF summarization in this lab, learning to minimize routing tables by summarizing contiguous networks and configuring area boundary summarization and area range for external routes.