Home

Chapter 3: Routing Dynamically

  • 3.0 Routing Dynamically
    • 3.0.1 Introduction
      • 3.0.1.1 Introduction
      • 3.0.1.2 How Much Does This Cost?
  • 3.1 Dynamic Routing Protocols
    • 3.1.1 Dynamic Routing Protocol Operation
      • 3.1.1.1 The Evolution of Dynamic Routing Protocols
      • 3.1.1.2 Purpose of Dynamic Routing Protocols
      • 3.1.1.3 The Role of Dynamic Routing Protocols
      • 3.1.1.4 Activity - Identify Components of a Routing Protocol
    • 3.1.2 Dynamic versus Static Routing
      • 3.1.2.1 Using Static Routing
      • 3.1.2.2 Static Routing Scorecard
      • 3.1.2.3 Using Dynamic Routing Protocols
      • 3.1.2.4 Dynamic Routing Scorecard
      • 3.1.2.5 Activity - Compare Static and Dynamic Routing
    • 3.1.3 Routing Protocol Operating Fundamentals
      • 3.1.3.1 Dynamic Routing Protocol Operation
      • 3.1.3.2 Cold Start
      • 3.1.3.3 Network Discovery
      • 3.1.3.4 Exchanging the Routing Information
      • 3.1.3.5 Achieving Convergence
      • 3.1.3.6 Packet Tracer - Investigating Convergence
    • 3.1.4 Types of Routing Protocols
      • 3.1.4.1 Classifying Routing Protocols
      • 3.1.4.2 IGP and EGP Routing Protocols
      • 3.1.4.3 Distance Vector Routing Protocols
      • 3.1.4.4 Link-State Routing Protocols
      • 3.1.4.5 Classful Routing Protocols
      • 3.1.4.6 Classless Routing Protocols
      • 3.1.4.7 Routing Protocol Characteristics
      • 3.1.4.8 Routing Protocol Metrics
      • 3.1.4.9 Activity - Classify Dynamic Routing Protocols
      • 3.1.4.10 Activity - Compare Routing Protocols
      • 3.1.4.11 Activity - Match the Metric to the Protocol
  • 3.2 Distance Vector Dynamic Routing
    • 3.2.1 Distance Vector Routing Protocol Operation
      • 3.2.1.1 Distance Vector Technologies
      • 3.2.1.2 Distance Vector Algorithm
      • 3.2.1.3 Activity - Identify Distance Vector Terminology
    • 3.2.2 Types of Distance Vector Routing Protocols
      • 3.2.2.1 Routing Information Protocol
      • 3.2.2.2 Enhanced Interior-Gateway Routing Protocol
      • 3.2.2.3 Activity - Compare RIP and EIGRP
      • 3.2.2.4 Packet Tracer - Comparing RIP and EIGRP Path Selection
  • 3.3 RIP and RIPng Routing
    • 3.3.1 Configuring the RIP Protocol
      • 3.3.1.1 Router RIP Configuration Mode
      • 3.3.1.2 Advertising Networks
      • 3.3.1.3 Examining Default RIP Settings
      • 3.3.1.4 Enabling RIPv2
      • 3.3.1.5 Disabling Auto Summarization
      • 3.3.1.6 Configuring Passive Interfaces
      • 3.3.1.7 Propagating a Default Route
      • 3.3.1.8 Packet Tracer - Configuring RIPv2
    • 3.3.2 Configuring the RIPng Protocol
      • 3.3.2.1 Advertising IPv6 Networks
      • 3.3.2.2 Examining the RIPng Configuration
      • 3.3.2.3 Packet Tracer - Configuring RIPng
      • 3.3.2.4 Lab - Configuring RIPv2
  • 3.4 Link-State Dynamic Routing
    • 3.4.1 Link-State Routing Protocol Operation
      • 3.4.1.1 Shortest Path First Protocols
      • 3.4.1.2 Dijkstra's Algorithm
      • 3.4.1.3 SPF Example
    • 3.4.2 Link-State Updates
      • 3.4.2.1 Link-State Routing Process
      • 3.4.2.2 Link and Link-State
      • 3.4.2.3 Say Hello
      • 3.4.2.4 Building the Link-State Packet
      • 3.4.2.5 Flooding the LSP
      • 3.4.2.6 Building the Link-State Database
      • 3.4.2.7 Building the SPF Tree
      • 3.4.2.8 Adding OSPF Routes to the Routing Table
      • 3.4.2.9 Activity - Building the Link-State Database and SPF Tree
    • 3.4.3 Why Use Link-State Routing Protocols
      • 3.4.3.1 Why Use Link-State Protocols?
      • 3.4.3.2 Disadvantages of Link-State Protocols
      • 3.4.3.3 Protocols that Use Link-State
  • 3.5 The Routing Table
    • 3.5.1 Parts of an IPv4 Route Entry
      • 3.5.1.1 Routing Table Entries
      • 3.5.1.2 Directly Connected Entries
      • 3.5.1.3 Remote Network Entries
      • 3.5.1.4 Activity - Identify Parts of an IPv4 Routing Table Entry
    • 3.5.2 Dynamically Learned IPv4 Routes
      • 3.5.2.1 Routing Table Terms
      • 3.5.2.2 Ultimate Route
      • 3.5.2.3 Level 1 Route
      • 3.5.2.4 Level 1 Parent Route
      • 3.5.2.5 Level 2 Child Route
      • 3.5.2.6 Activity - Identify Parent and Child IPv4 Routes
    • 3.5.3 The IPv4 Route Lookup Process
      • 3.5.3.1 Route Lookup Process
      • 3.5.3.2 Best Route = Longest Match
      • 3.5.3.3 Activity - Determine the Longest Match Route
    • 3.5.4 Analyze an IPv6 Routing Table
      • 3.5.4.1 IPv6 Routing Table Entries
      • 3.5.4.2 Directly Connected Entries
      • 3.5.4.3 Remote IPv6 Network Entries
      • 3.5.4.4 Activity - Identify Parts of an IPv6 Routing Table Entry
  • 3.6 Summary
    • 3.6.1 Summary
      • 3.6.1.1 IPv6 - Details, Details…
      • 3.6.1.2 Summary
  • Expand All
  • Collapse All