Study guide

5.1 Enterprise Routing Principles: Distance Vector vs. Link-State, EIGRP, and OSPF

Cisco ENCOR 350-401 CCNP Enterprise Core

Track your progress as you read

Finished sections get a check mark.

1 Introduction & Exam Overview

0.1 Cisco 350-401 ENCOR Exam Logistics, Blueprint Structure, and Certification Paths 0.2 Preparation Strategy, Lab Environment Setup, and Practical Test Pacing

2 Enterprise Campus Architecture and High Availability

1.1 Enterprise Network Design: Two-Tier, Three-Tier, Fabric, and Cloud Architectures 1.2 High Availability Architecture: Device Redundancy, FHRPs, and Stateful Switchover (SSO) 1.3 Quality of Service (QoS) Architecture, Classification, Queuing, and Configuration Interpretation

3 Cisco Software-Defined Architecture: SD-WAN and SD-Access

2.1 Cisco Catalyst SD-WAN: Control, Management, and Data Planes 2.2 Cisco SD-Access Architecture: Control Plane, Data Plane, and Fabric Node Roles 2.3 SD-Access Campus Interoperability: Integrating Traditional Networks with Fabric

4 Device and Network Virtualization Technologies

3.1 Device Virtualization: Type 1/2 Hypervisors, Virtual Machines, and Virtual Switching 3.2 Data Path Virtualization: VRF-Lite, GRE Tunneling, and IPsec VPN Fundamentals 3.3 Network Virtualization Overlays: LISP and VXLAN Encapsulation Mechanics

5 Layer 2 Infrastructure: Trunking, EtherChannel, and Spanning Tree

4.1 802.1Q Trunking, Native VLAN, and Dynamic Trunking Protocol Troubleshooting 4.2 EtherChannel Bundling: Static, LACP, and PAgP Implementation and Verification 4.3 Spanning Tree Architecture: RSTP, MST, and STP Protection Mechanisms

6 Layer 3 Routing: OSPF Multi-Area and Protocol Comparison

5.1 Enterprise Routing Principles: Distance Vector vs. Link-State, EIGRP, and OSPF 5.2 OSPFv2 and OSPFv3 Multi-Area Architecture: LSAs, Area Types, and Summarization 5.3 Policy-Based Routing (PBR) Architecture, Configuration, and Route-Maps

7 Exterior Routing: BGP Peering and Path Selection

6.1 External BGP (eBGP) Peering, States, Neighbor Adjacencies, and Timers 6.2 BGP Path Attributes and the Step-by-Step Best Path Selection Algorithm

8 IP Services and First-Hop Redundancy

7.1 Time Synchronization: Network Time Protocol (NTP) and Precision Time Protocol (PTP) 7.2 Network Address Translation: Static NAT, Dynamic NAT, and PAT/Overload 7.3 First Hop Redundancy Protocols: HSRP and VRRP Implementation and Failover

9 IP Multicast Architecture and Protocols

8.1 Multicast Addressing, IGMPv2/v3 Host Membership, and the RPF Check 8.2 Protocol Independent Multicast Sparse Mode (PIM-SM) and Rendezvous Point Discovery 8.3 Anycast RP with MSDP, Source-Specific Multicast (SSM), and Bidirectional PIM

10 Network Diagnostics, Monitoring, and Telemetry

9.1 Network Diagnostic Tools: Conditional Debugging, Traceroute, SNMPv3, and Syslog Logging 9.2 Flexible NetFlow (FNF) Architecture: Flow Records, Exporters, and Monitors 9.3 Switched Port Analyzer: Local SPAN, Remote SPAN (RSPAN), and Encapsulated RSPAN (ERSPAN)

11 Performance Monitoring and Model-Driven Assurance

10.1 IP Service Level Agreements (IP SLA) Probes, Responder, and Route Tracking 10.2 Cisco Catalyst Center: Assurance Dashboards, AI Analytics, and Machine Reasoning Workflows 10.3 Model-Driven Telemetry and Programmable Interfaces: NETCONF and RESTCONF Verification

12 Device Access Control and AAA Architecture

11.1 Device Line Protection: Console, Aux, VTY, Local Authentication, and Privilege Levels 11.2 AAA Architecture: Comparing RADIUS vs. TACACS+ and Method List Configuration

13 Infrastructure Security: ACLs, CoPP, and API Security

12.1 IPv4 and IPv6 Access Control Lists (ACLs): Standard, Extended, and Named Rules 12.2 Control Plane Policing (CoPP): Protecting the Route Processor with MQC 12.3 REST API Security: Token Authentication, TLS Transport, and Rate Limiting

14 Enterprise Network Security Design: ISE, TrustSec, and MACsec

13.1 Endpoint Security Architecture: 802.1X, Cisco ISE Posture, and Profiling 13.2 Next-Generation Firewalls (FTD) and Enterprise Threat Defense Design 13.3 Cisco TrustSec (Security Group Tags) and MACsec (802.1AE) Layer 2 Encryption

15 Network Automation Fundamentals: Python, JSON, and YANG

14.1 Python Fundamentals for Network Engineers: Data Types, Control Flow, and Libraries 14.2 JSON Data Encoding: Syntax, Formatting Rules, and Python Serialization 14.3 YANG Data Modeling: Modules, Tree Structures, and Data Representation

16 Controller REST APIs and RESTCONF Implementation

15.1 Cisco Catalyst Center Intent APIs and Authentication Workflows 15.2 Cisco Catalyst SD-WAN Manager (vManage) REST APIs and Device Interaction 15.3 RESTCONF Protocol Operations: HTTP Verbs, Datastores, and Response Codes

17 Event-Driven Automation and Infrastructure Orchestration

16.1 Cisco Embedded Event Manager (EEM) Applet Architecture and Event Detectors 16.2 Configuration Management: Comparing Ansible, Puppet, Chef, and SaltStack 16.3 Infrastructure as Code (IaC) Principles with Terraform in Enterprise Networks

5.1 Enterprise Routing Principles: Distance Vector vs. Link-State, EIGRP, and OSPF

Key Takeaways Explain This Topic AI

Longest Prefix Match (LPM) is the foremost route evaluation rule in routing tables, always taking precedence over Administrative Distance and metric.

Administrative Distance (AD) arbitrates between conflicting routing sources advertising the exact same IP prefix; lower AD values are preferred.

Distance vector protocols route by rumor with limited topological visibility, whereas link-state protocols construct a synchronized link-state database (LSDB) and execute Dijkstra's Shortest Path First (SPF) algorithm.

EIGRP utilizes the Diffusing Update Algorithm (DUAL) to guarantee instantaneous, loop-free backup path failover whenever a Feasible Successor satisfies the Feasibility Condition (Reported Distance < Feasible Distance).

Classic EIGRP composite metric defaults to weighting bandwidth and delay (K1=1, K3=1), while setting load, reliability, and MTU weights to zero (K2=K4=K5=0).

Last updated: October 2026

Enterprise Routing Principles: Distance Vector vs. Link-State, EIGRP, and OSPF

Enterprise IP routing forms the bedrock of campus, data center, and wide-area network communications. Routers build forwarding paths by exchanging reachability information through Interior Gateway Protocols (IGPs). To optimize network convergence, avoid forwarding loops, and make deterministic traffic engineering decisions, network engineers must master the foundational algorithms, protocol structures, and route selection criteria that govern modern enterprise routing engines.

The Route Selection Hierarchy

When a router receives a packet, its forwarding plane inspects the destination IP address and queries the routing table (Routing Information Base, or RIB) to locate the best exit interface and next hop. If multiple routing protocols or static sources provide reachability data, the routing engine evaluates paths using a strict three-tiered decision hierarchy: +-------------------------------------------------------------+

  • | 1. LONGEST PREFIX MATCH (LPM) |
  • | Evaluates subnet mask length (/32 down to /0). |
  • | Always takes absolute precedence over all other criteria.|
  • +-------------------------------------------------------------+
  • |
  • v
  • +-------------------------------------------------------------+
  • | 2. ADMINISTRATIVE DISTANCE (AD) |
  • | Evaluated ONLY when identical prefix/mask entries exist. |
  • | Prefers the routing source with the lowest AD value. |
  • +-------------------------------------------------------------+
  • |
  • v
  • +-------------------------------------------------------------+
  • | 3. PROTOCOL METRIC |
  • | Evaluated within the SAME protocol and prefix. |
  • | Lowest metric (cost, composite, hop count) is installed. |
  • +-------------------------------------------------------------+
  • 1. Longest Prefix Match (LPM)

The router compares the destination IP address against all routing entries bit-by-bit from left to right. The entry with the most matching leading bits (the longest prefix length or most specific subnet mask) wins unconditionally. For instance, a /28 route is chosen over a /24 or /16 route regardless of which protocol installed them or what their administrative distance values are.

2. Administrative Distance (AD)

Administrative Distance is a local trustworthiness rating assigned to each routing information source. If two different routing protocols (or a static route and an IGP) advertise the exact same IP prefix and prefix length (e.g., both advertise 10.10.10.0/24 ), the router installs the prefix from the source with the lower AD value into the forwarding table.

3. Metric Comparison

If a single routing protocol learns multiple paths to the exact same prefix with identical subnet masks, it compares the protocol-specific metrics (such as OSPF cost or EIGRP composite metric). The path with the lowest metric is installed. If metrics are identical, Equal-Cost Multi-Path (ECMP) load balancing occurs across the matching paths.

Administrative Distance Hierarchy

Cisco IOS assigns default Administrative Distance values across routing mechanisms, ranked from most trusted (lowest number) to untrusted (highest number):

  • Route Source Default AD Architectural Role & Context
  • Directly Connected 0 Physical or logical interface with an assigned IP in an 'up/up' state
  • Static Route 1 Manually entered route pointing to a next-hop IP or egress interface
  • eBGP (External BGP) 20 Peering sessions between distinct Autonomous Systems
  • EIGRP (Internal) 90 Routes originated and discovered within the same EIGRP AS
  • OSPF 110 Open standard link-state routing protocol
  • IS-IS 115 Link-state protocol operating at Layer 2 (used extensively in service providers)
  • RIP (v1 / v2) 120 Legacy distance vector protocol utilizing hop count
  • EIGRP (External) 170 Routes redistributed into EIGRP from external sources (e.g., OSPF, static)
  • iBGP (Internal BGP) 200 BGP peering sessions within the same Autonomous System
  • Unusable / Unknown 255 Route is discarded and cannot be installed in the routing table

Floating Static Routes: By manually configuring a static route with an administrative distance higher than the active IGP (e.g., ip route 10.0.0.0 255.0.0.0 192.0.2.1 115 to back up OSPF at AD 110), the static route remains dormant in configuration until the primary IGP route fails, offering deterministic backup connectivity.

Interior Gateway Protocol (IGP) Architectural Comparison

Interior Gateway Protocols operate within a single autonomous domain and fall into three primary architectural classes: traditional Distance Vector, Link-State, and Advanced (Hybrid) Distance Vector.

  • Architectural Attribute Distance Vector (RIPv2) Advanced Distance Vector (EIGRP) Link-State (OSPFv2 / OSPFv3)
  • Underlying Algorithm Bellman-Ford Diffusing Update Algorithm (DUAL) Dijkstra Shortest Path First (SPF)

Network Visibility "Routing by rumor" (knows only immediate neighbors) Topology table of neighbor-advertised vectors Complete, synchronized link-state map of the area

Routing Metric Hop count (maximum 15 hops; 16 = unreachable) Composite: Bandwidth and Delay (classic or wide) Cumulative Cost (Reference Bandwidth / Interface Bandwidth)

Convergence Speed Slow; dependent on periodic timers (30s updates) Very fast; immediate failover via Feasible Successor Fast; rapid LSA flooding and local SPF execution

CPU & Memory Overhead Very low memory and computational requirements Moderate memory (topology table); low CPU during steady state High memory (LSDB) and intensive CPU spikes during SPF recalculation

Loop Prevention Split horizon, poison reverse, holddown timers Feasibility Condition (Reported Distance < Feasible Distance) Loop-free SPF tree rooted at the local router

Update Mechanism Full periodic table broadcasts/multicasts (224.0.0.9) Bounded, triggered partial updates via reliable RTP Triggered Link-State Updates (LSU); refreshed every 30 minutes

Hierarchical Structure Flat topology; no summarization boundaries Flexible; arbitrary summarization on any router interface Strict two-tier hierarchy: Backbone Area 0 and non-backbone areas

  • Distance Vector vs. Link-State Mechanics
  • Distance Vector and "Routing by Rumor"

Traditional distance vector protocols determine the distance (metric) and vector (next hop direction) to target networks based solely on the second-hand advertisements of their direct neighbors. Routers possess no end-to-end topological awareness. Because routers depend on periodic broadcasts, distance vector networks are vulnerable to routing loops and the "count-to-infinity" problem when links flap.

Mitigation techniques in distance vector include:

Split Horizon: A router never advertises a route back out the same interface through which it was learned.

Poison Reverse: Explicitly advertising a failed route with an unreachable metric (infinity / 16 hops in RIP) to immediately invalidate neighbor cache entries.

Holddown Timers: Preventing a router from accepting new advertisements for a flapping route for a designated period, allowing network stability to restore.

Link-State and Dijkstra's Algorithm

Link-state protocols abandon routing by rumor. Instead of advertising forwarding tables, each router discovers its local interfaces and neighbors, encapsulates this information into Link-State Advertisements (LSAs), and floods them to all routers within the area. Every router in that area stores these LSAs in an identical Link-State Database (LSDB) .

Once synchronized, each router independently runs the Dijkstra Shortest Path First (SPF) algorithm with itself as the root of the tree, calculating the shortest loop-free path to every destination prefix. Although highly resilient and fast-converging, running SPF across large enterprise topologies consumes substantial CPU and memory, requiring hierarchical area segmentation to bound calculation domains.

EIGRP and the Diffusing Update Algorithm (DUAL)

Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP) combines the rapid convergence of link-state protocols with the operational simplicity of distance vector. EIGRP does not maintain a complete topology graph; rather, it uses the Diffusing Update Algorithm (DUAL) to track neighbor reachability and guarantee loop-free backup routes.

EIGRP Composite Metric Formula

Classic EIGRP calculates a 32-bit composite metric using five configurable weighting coefficients ( K 1 K_1 K 1 ​ through K 5 K_5 K 5 ​ ):

Metric = 256 × ( K 1 × Bandwidth + K 2 × Bandwidth 256 − Load + K 3 × Delay ) × ( K 5 Reliability + K 4 ) \text{Metric} = 256 \times \left( K_1 \times \text{Bandwidth} + \frac{K_2 \times \text{Bandwidth}}{256 - \text{Load}} + K_3 \times \text{Delay} \right) \times \left( \frac{K_5}{\text{Reliability} + K_4} \right) Metric = 256 × ( K 1 ​ × Bandwidth + 256 − Load K 2 ​ × Bandwidth ​ + K 3 ​ × Delay ) × ( Reliability + K 4 ​ K 5 ​ ​ )

By default, Cisco IOS sets K 1 = 1 K_1 = 1 K 1 ​ = 1 , K 3 = 1 K_3 = 1 K 3 ​ = 1 , and K 2 = K 4 = K 5 = 0 K_2 = K_4 = K_5 = 0 K 2 ​ = K 4 ​ = K 5 ​ = 0 . When default K K K -values are active, the complex formula reduces to:

Metric = 256 × ( Bandwidth + Delay ) \text{Metric} = 256 \times (\text{Bandwidth} + \text{Delay}) Metric = 256 × ( Bandwidth + Delay )

Where:

Bandwidth: 10 7 Minimum Interface Bandwidth along path (in kbps) \frac{10^7}{\text{Minimum Interface Bandwidth along path (in kbps)}} Minimum Interface Bandwidth along path (in kbps) 1 0 7 ​

Delay: Cumulative Interface Delay along path (in microseconds) 10 \frac{\text{Cumulative Interface Delay along path (in microseconds)}}{10} 10 Cumulative Interface Delay along path (in microseconds) ​

(Note: Setting K 5 = 0 K_5 = 0 K 5 ​ = 0 removes the reliability multiplier term from the equation entirely rather than multiplying by zero). Both the EIGRP Autonomous System number and K K K -values must match identically between adjacent routers to form a neighbor relationship.

DUAL Terminology and Loop Freedom [Neighbor Router] -------- Advertises Reported Distance (RD) --------> [Local Router]

  • | |
  • Direct Path Total Metric
  • to Destination to Destination
  • | |
  • v v
  • [Destination Subnet] <--------------------------------------------- [Feasible Distance (FD)]

Feasible Distance (FD): The lowest calculated metric from the local router to the destination subnet across all viable paths.

Reported Distance (RD) / Advertised Distance (AD): The metric to the destination subnet as reported by an adjacent neighbor router (the neighbor's own calculated metric).

Successor: The primary neighbor path offering the lowest overall metric (FD) to the destination. The successor route is installed into the active routing table.

Feasible Successor (FS): A backup neighbor that satisfies the Feasibility Condition . An FS is pre-computed and stored in the EIGRP topology table, enabling instantaneous (sub-second) failover if the primary successor fails.

Feasibility Condition (FC): A neighbor qualifies as a Feasible Successor if and only if:

Reported Distance (RD) < Current Feasible Distance (FD) \text{Reported Distance (RD)} < \text{Current Feasible Distance (FD)} Reported Distance (RD) < Current Feasible Distance (FD)

Why the Feasibility Condition Guarantees Loop Freedom: If a neighbor's metric to reach a destination is strictly less than your current best metric (FD), that neighbor cannot possibly be routing packets back through you to reach that destination. If its path looped through you, its reported distance would necessarily be higher than your feasible distance.

Step-by-Step DUAL Calculation Walkthrough

Consider Router R1 evaluating three potential paths to reach destination network 192.168.100.0/24 :

Path via Neighbor Path Minimum Bandwidth Cumulative Delay Local Calculated Metric (FD) Neighbor Reported Distance (RD) DUAL Status & Rationale

Neighbor R2 100,000 kbps (100 Mbps) 700 μ s \mu s μ s 43,520 40,960 Successor: Lowest total metric (FD = 43,520). Installed in the routing table.

Neighbor R3 10,000 kbps (10 Mbps) 1,400 μ s \mu s μ s 291,840 35,840 Feasible Successor: RD (35,840) < FD (43,520). Meets the FC even though its own total metric is much worse.

Neighbor R4 100,000 kbps (1 Gbps first hop, 100 Mbps later) 1,010 μ s \mu s μ s 51,456 51,200 Neither: RD (51,200) > FD (43,520). Fails the FC even though its total metric is close to the successor's.

Check the arithmetic with the default K-values. For the path through R2: Metric R 2 = 256 × ( 10 7 100,000 + 700 10 ) = 256 × ( 100 + 70 ) = 43,520 \text{Metric}_{R2} = 256 \times \left(\frac{10^{7}}{100{,}000} + \frac{700}{10}\right) = 256 \times (100 + 70) = 43{,}520 Metric R 2 ​ = 256 × ( 100 , 000 1 0 7 ​ + 10 700 ​ ) = 256 × ( 100 + 70 ) = 43 , 520

For the path through R3, the 10 Mbps link dominates: 256 × ( 1,000 + 140 ) = 291,840 256 \times (1{,}000 + 140) = 291{,}840 256 × ( 1 , 000 + 140 ) = 291 , 840 . R3's reported distance is calculated the same way from R3's own path (100 Mbps minimum bandwidth and 400 μ s \mu s μ s of delay): 256 × ( 100 + 40 ) = 35,840 256 \times (100 + 40) = 35{,}840 256 × ( 100 + 40 ) = 35 , 840 .

If the primary link through R2 fails, R1 immediately promotes R3 as the new successor without recalculating or sending DUAL query packets. Path R4 remains available in the topology table, but if both R2 and R3 fail, R1 must place the route into an Active state and transmit DUAL queries to determine whether R4 offers a loop-free path.

Load Balancing: EIGRP vs. OSPF

Topic 3.2.a also asks you to compare load balancing:

Behavior EIGRP OSPF

Equal-cost paths Installs multiple equal-metric successors ( maximum-paths , default 4 on Cisco IOS) Installs multiple equal-cost paths ( maximum-paths , default 4 on Cisco IOS)

Unequal-cost paths Supported with variance : a feasible successor is installed if its metric is less than variance × FD Not supported; only equal-cost paths are installed

Traffic sharing With unequal-cost paths, traffic is shared in proportion to the metrics by default ( traffic-share balanced ) Shared equally across the equal-cost paths

In the walkthrough above, R3's metric is 291,840 and the FD is 43,520, a ratio of about 6.7. Configuring variance 7 under the EIGRP process would install R3 alongside R2. R4 can never be used for unequal-cost load balancing, however high the variance, because it is not a feasible successor.