Chapter 3: Internetworking

Nature seems … to reach many of her ends by long circuitous routes.

—Rudolph Lotze

• Problem: Not All Networks are Directly Connected
• 3.1 Switching Basics
  • 3.1.1 Datagrams
  • 3.1.2 Virtual Circuit Switching
  • 3.1.3 Source Routing
• 3.2 Switched Ethernet
  • 3.2.1 Learning Bridges
  • 3.2.2 Implementation
  • 3.2.3 Spanning Tree Algorithm
  • 3.2.4 Broadcast and Multicast
  • 3.2.5 Virtual LANs (VLANs)
• 3.3 Internet (IP)
  • 3.3.1 What Is an Internetwork?
  • 3.3.2 Service Model
  • 3.3.3 Global Addresses
  • 3.3.4 Datagram Forwarding in IP
  • 3.3.5 Subnetting and Classless Addressing
  • 3.3.6 Address Translation (ARP)
  • 3.3.7 Host Configuration (DHCP)
  • 3.3.8 Error Reporting (ICMP)
  • 3.3.9 Virtual Networks and Tunnels
• 3.4 Routing
  • 3.4.1 Network as a Graph
  • 3.4 2 Distance-Vector (RIP)
  • 3.4.3 Link State (OSPF)
  • 3.4.4 Metrics
• 3.5 Implementation
  • 3.5.1 Software Switch
  • 3.5.2 Hardware Switch
  • 3.5.3 Software Defined Networks
• Perspective: Virtual Networks All the Way Down