Differentiate public IP addresses from private addresses used for internet. Identify private ranges such as 10.0.0.0 to 10.255.255.255, 172.16.0.0 to 172.31.255.255, and 192.168.0.0 to 192.168.255.255, plus subnet masks.

Learn how subnetting divides a network into subnets to conserve IP space, with /24 network examples, distinct network IDs, gateways, and router interconnections.

Explains class B subnetting at /18, calculating block sizes and subnet ranges, and identifying first and last hosts and broadcast addresses for 172.16.x.x networks.

Explore class B subnetting with /19 in a 172.16.0.0/16 network, calculating eight subnets, block sizes, and host ranges including first and last hosts and broadcast addresses.

Explore class B subnetting with a /20 mask, computing block size, deriving 16 subnets, and identifying first host and broadcast addresses for each subnet.

Explore class B subnetting at /21, calculate borrowed bits and subnet counts, and apply real network examples such as 172.16.0.0, 172.16.8.0, and 172.16.24.0.

Learn class B subnetting at /23 with cidr calculations, determine total subnets and hosts, and derive the 255.255.254.0 subnet mask for efficient network design.

Learn how to subnet a class B network into /30 blocks, compute block size, subnet addresses, and host ranges using CIDR and practical step-by-step calculations.

Learn how to subnet class a networks at /20 by applying cidr math, determining block sizes, counting subnets, and identifying valid host ranges and broadcast addresses.

Explore class a subnetting at /24 and analyze subnetting math using cidr notation, calculate block sizes, total subnets, and host counts for network design.

Learn class A subnetting at /28, performing subsetting steps and calculating block size of 16 to determine subnet boundaries and host ranges.

Explore routing protocols that dynamically learn routes and exchange information with neighbor routers. Define directly connected networks and IP addressing while applying interior and exterior gateway types.

Learn how routing protocols operate inside an autonomous system and compare IGPs such as distance vector, length state, and enhanced distance vector.

Explore exterior gateway protocols, focusing on BGP as a path vector routing protocol that uses attributes to select the best route between organizations.

Explore classful addressing with a, b, and c networks and their default masks, and learn how classless addressing introduces flexible subnets using prefixes like /30.

Learn how administrative distance helps routers choose the most trustworthy route from various protocols, preferring the least administrative distance, with examples from directly connected, static, OSPF, ISIS, and BGP.

Explain convergence time for removing invalid routes and demonstrate address summarization by aggregating several /24 networks into 192.168.0.0/21 (255.255.248.0).

Learn RIP route poisoning and its use of a 16 metric to advertise bad news, propagate updates across routers, and prevent routing loops through poisoned routes in a simple network.

Rip lab demonstrates configuring passive interfaces so line interfaces receive updates but do not send updates, and verifies routing advertisements.

Explore configuring RIP authentication in a lab, using MD5 key chain, interface-based authentication, and two-way authentication to prevent invalid routes.

Learn to filter routes in rip using administrative distance by configuring access lists and applying them to router rip.

Explore the reliable transport protocol (RTP) for DRP messages, outlining five message types—hello, update, acknowledgment, query, and reply—with multicast and unicast delivery in EGNOS routing contexts.

Explore how the EIGRP component NDR maintains neighbors and uses a five-second hello interval, removing a neighbor after no hello for 15 seconds.

Explore the diffusing update algorithm, called DUAL, used by EIGRP in enhanced distance-vector routing protocol.

Discusses EIGRP successor concept, how to determine the best route using distance and metric calculations, and selecting the successor in a network diagram.

Learn about EIGRP additional features, including incremental updates, multicast update service, and equal-cost load balancing, with practical guidance on how best effort multipliers affect route selection and traffic distribution.

Configure an EIGRP lab from a diagram, set up virtual machines, host-only networks, and switches, assign IPs to PCs, verify connectivity with pings, and save the initial configuration.

Configure EIGRP authentication on interfaces using key chains and keystreams, enable authentication on both sides, and verify neighbor adjacency with debug and show commands.

Verify the classic EIGRP neighbor table by examining each neighbor entry’s interface, uptime, hold time, round-trip time, retransmission time, timeout, queue, and last update sequence.

Configure equal cost load balancing in an EIGRP lab, and explore unequal cost load balancing with multipliers and best effort for selective traffic sharing.

Learn how to tune the EIGRP metric by adjusting the K1–K5 values on routers, and ensure changes across all routers to affect routing decisions.

Configure a default route in a classic EIGRP lab using the ip default-network command on R1 to advertise a classful default and propagate it to R2.

Learn how to filter routes in a classic EIGRP lab using access lists and administrative distance, configure and remove filters, and observe how routes from neighbors are accepted or blocked.

Disable the EIGRP active timeout to shorten the three minute active state when a successor goes down with no feasible successor, triggering neighbor queries.

Explore classic EIGRP route summarization with leak-map, using route maps and access lists to selectively summarize networks like 1.0 and 2.0, and apply leak-map to control redistributed routes.

Change named eigrp hello timer by setting hello interval on interfaces to two seconds, configure address family ipv4 unicast, and verify changes.

Learn to configure named EIGRP offset-list for IPv4 unicast to influence route selection by applying offset values with a set list and access lists, and verify with show ip route.

Configure named EIGRP max-path to control the number of equal-cost IPv4 unicast routes, set the maximum paths, and verify the changes on the router.

Master how to configure a default route and redistribute it into named EIGRP. Troubleshoot why static redistribution may fail on certain platforms and explore alternative methods to reach the internet.

Learn how to disable the EIGRP active timer in a named EIGRP configuration. Discover the command to disable it and how to apply it within the routing setup.

Learn how to configure named EIGRP stub routers in a two-router setup, follow a three-step process, and verify IPv4 unicast routing to ensure the route becomes established.

Explore OSPF introduction, the interior gateway link-state routing protocol, with IP protocol number 89 and multicast hello neighbors at 224.0.0.5 and 224.0.0.6.

Explore OSPF neighbor states from down to full, including init, two-way, exstart, exchange, loading; learn how frame relay NBMA requires neighbor setup and unicast hello for adjacency and database synchronization.

Explore how OSPF areas group routers into a backbone area 0 and regular areas that must connect to the backbone, with up to 4.2 billion areas possible.

Explain how the designated router and backup designated router operate in ospf on multi-access networks, including how the dr forms adjacencies with all routers and how the bdr provides backup.

Explore OSPF network types and how hello and dead intervals vary by network type. Learn that non-broadcast requires manual neighbor configuration, while broadcast supports automatic neighbors and dr/bdr elections.

Learn about OSPF router types, including internal and backbone routers, and how they connect regular areas to the backbone via border routers and area zero.

Explore ospf neighbor relationship requirements, including subnet masks, hello practices, update mechanisms, and maximum transmission unit considerations for establishing and maintaining adjacencies.