Lecture Notes: Dynamic Routing Protocols

Introduction

• Discussed the process of transferring information over the internet.
• Explained the role of routers and routing tables in managing traffic.

Dynamic Routing Protocols

• Purpose: Update routing tables automatically based on network conditions.
• Functions:
  • Listen for nearby routers.
  • Send advertisements to collaborate on routing tables.
  • Handle network outages through convergence processes.

Choosing a Routing Protocol

• Criteria:
  • State of the link (up or down).
  • Distance (number of hops).
  • Speed of communication.
  • Compatibility with devices (proprietary vs. open).

Types of Routing Protocols

1. Distance Vector Routing Protocols
   • Determine best route based on number of hops.
   • Simple configuration; not scalable for large networks.
   • Examples: Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP).
   • Example Scenario:
     • Sam to Jack via R2 to R1 (shortest hops, 100 Mbps link).
2. Link State Routing Protocols
   • Use network status and speed to determine routes.
   • Scalable for large networks.
   • Example: Open Shortest Path First (OSPF).
   • Example Scenario:
     • Sam to Jack via R2 to R3 to R1 (faster links, 1 Gbps).
3. Hybrid Routing Protocols
   • Combine features of distance vector and link state protocols.
   • Example: Border Gateway Protocol (BGP).
   • Determine best routes based on path, policies, speed, and custom rules.

Summary

• Distance vector protocols prioritize shortest hops, suitable for smaller networks.
• Link state protocols prioritize faster connections, suitable for larger networks.
• Hybrid protocols offer a combination of both approaches for enhanced routing flexibility.