CS334/534 Networking Ultimate Study Hub

Sections

Current Module:

Module 1

Network Evolution & Concepts

📖 Textbook

Dordal: An Introduction to Computer Networks

(FREE online)

📡

Module 1: Network Fundamentals

Evolution of Networks, Terminology, OSI & TCP/IP Models

Lectures 0.1, 1.1, 1.2, 1.3 • Book: Chapter 1 (1.1–1.4)

🌐

What is a Network?

• Nodes: Interconnected entities (computers, devices)
• Communication: Transfer of data/signals
• Resource Sharing: Data, hardware, services
• Protocols: Rules governing transmission

📜

Network Evolution Timeline

1820sTelegraph (Morse)

1876Telephone (Bell)

1969ARPAnet (4 nodes)

1973Ethernet (Xerox PARC)

1989WWW (Berners-Lee)

1997Wi-Fi (802.11)

🎯

ARPAnet (1969)

• First public packet-switched network
• First 4 nodes: UCLA, UCSB, Stanford, Utah
• First message: "lo" (intended "login", crashed!)
• First email sent: 1971
• Led to TCP/IP development (1977)

📦

Packet Switching

• Data broken into packets (modest-sized byte sequences)
• Each packet has header (address, metadata)
• Packets routed independently (stateless)
• Why small packets? Better sharing, faster recovery

Ethernet packet: max 1500 bytes

⚡

Data Rates: bits vs bytes

b = bits (lowercase)

B = Bytes (uppercase)

Mbps = 10⁶ bits/sec

1 Byte = 8 bits

Bandwidth: Raw bit rate
Throughput: Effective rate (with overhead)
Goodput: Application-layer usable data

🏗️

Network Layers (Simplified)

Application Layer

Transport Layer

IP/Network Layer

Link/LAN Layer

Physical Layer

Each layer only talks to layers above/below it

📐

OSI Model (7 Layers) vs TCP/IP (4 Layers)

OSI Model (7)

7. Application

6. Presentation

5. Session

4. Transport

3. Network

2. Data Link

1. Physical

TCP/IP Model (4)

Application

Transport (TCP/UDP)

Internet (IP)

Network Access

🔀

Switches vs Routers

🔌 Switch

• Works at LAN/Link Layer
• Forwards based on MAC address
• Connects devices in same network

🌐 Router

• Works at IP/Network Layer
• Forwards based on IP address
• Connects different networks

📊 Module 1 Diagrams & Models

Visual representations of network concepts

Encapsulation: Data Through Layers

Application Data

↓ + TCP Header

TCP Data

↓ + IP Header

IP TCP Data

↓ + Ethernet Header

ETH IP TCP Data CRC

Each layer adds its own header (14+20+20 = 54 bytes of overhead)

Packet Header Sizes

Ethernet Header

bytes

IP Header

bytes

TCP Header

bytes

Total Overhead: 54 bytes per packet

📋 Module 1 Key Formulas & Facts

Essential calculations and conversions

Data Rate Conversions

1 Byte = 8 bits

1 kbps = 10³ bits/sec

1 Mbps = 10⁶ bits/sec

1 Gbps = 10⁹ bits/sec

Example: File Transfer Time

Given: 500 Mbps connection, 1 MB file

Step 1: Convert Mbps to bytes/sec

500 Mbps = 500 × 10⁶ bits/sec ÷ 8 = 62,500,000 bytes/sec

Step 2: Calculate time

1 MB = 1,048,576 bytes (2²⁰)

Time = 1,048,576 ÷ 62,500,000 ≈ 0.017 seconds

Key Network Facts

📦 Max Ethernet packet: 1500 bytes
🏷️ TCP/IP overhead: 54 bytes (Eth 14 + IP 20 + TCP 20)
🌐 IPv4 address: 32 bits (4 octets, 4.3 billion addresses)
📍 MAC address: 48 bits (6 bytes)
⏰ First ARPAnet message: Oct 29, 1969

Network Utilities Commands

ping - Test if host is reachable

traceroute - Show route to host

ifconfig/ipconfig - Show IP config

route - Show routing table

nslookup - DNS lookup

wireshark - Packet analyzer

🎯 Module 1 Quiz

Network Fundamentals & Models

1. What was the first message sent over ARPAnet?

2. How many layers does the OSI model have?

3. What is the maximum size of an Ethernet packet (payload)?

4. In networking, what does "Mbps" measure?

5. Which device forwards packets based on IP address?

6. Who invented the World Wide Web?

🎓

Module 1: Lecture Walkthrough

Step-by-step guide through Network Fundamentals

📖 Lectures 0.1, 1.1, 1.2, 1.3 • Book: Chapter 1 (1.1–1.4)

📘 Lecture 0.1: Introduction to Networking

Course overview and fundamental concepts

0.1

What is a Computer Network?

⏱️ 15 min • Core definitions

🎯 Learning Goals

• Define what a computer network is
• Identify the components of a network
• Explain why networks are essential

🌐 Key Concepts

• Network: Interconnected nodes that can communicate
• Nodes: Computers, servers, phones, IoT devices
• Links: Physical (cables, fiber) or wireless connections
• Purpose: Resource sharing, communication, reliability

✅ Checkpoint

What three things do networks allow us to share? → Data, Hardware, Services

📘 Lecture 1.1: Network History

Evolution from telegraph to modern internet

1.1

Network Evolution Timeline

⏱️ 20 min • Key milestones and inventors

🎯 Learning Goals

• Recall key dates and inventors in networking history
• Explain the significance of ARPAnet
• Understand the progression from telegraph to internet

📜 Key Milestones

1820s: Telegraph (Morse)

1876: Telephone (Bell)

1969: ARPAnet (4 nodes)

1973: Ethernet (Metcalfe)

1989: WWW (Berners-Lee)

1997: Wi-Fi (802.11)

🎯 ARPAnet Details

• First 4 nodes: UCLA, UCSB, Stanford, Utah
• First message: "lo" (crashed after 2 letters of "login")
• Date: October 29, 1969

✅ Checkpoint

Who invented the World Wide Web and when? → Tim Berners-Lee at CERN in 1989

📘 Lecture 1.2: Network Terminology & Concepts

Bandwidth, throughput, latency, and packet switching

1.2.1

Network Terminology

⏱️ 25 min • Data rates and units

🎯 Learning Goals

• Distinguish between bandwidth, throughput, and goodput
• Convert between bits and bytes correctly
• Understand latency components

📊 Data Rate Terms

Bandwidth: Raw bit rate capacity (theoretical max)

Throughput: Effective rate achieved (actual)

Goodput: Usable application data rate

Latency: Time delay from A to B

🔢 Units: bits vs Bytes

b = bits (lowercase), B = Bytes (uppercase)

1 Byte = 8 bits • 1 Mbps = 10⁶ bits/sec

✅ Checkpoint

What's the difference between bandwidth and throughput? → Bandwidth is theoretical max, throughput is actual achieved rate

Packet Switching

⏱️ 20 min • Lecture 1.2

📦 How Packet Switching Works

• Data broken into small packets
• Each packet has a header (destination address, metadata)
• Packets routed independently (may take different paths)
• Reassembled at destination

💡 Why Small Packets?

• Better sharing of network resources
• Faster error recovery (only retransmit small piece)
• Reduced congestion at any one point

✅ Checkpoint

What's the maximum Ethernet packet payload size? (Answer: 1500 bytes)

OSI & TCP/IP Models

⏱️ 30 min • Lecture 1.3

OSI Model (7 Layers)

7. Application

6. Presentation

5. Session

4. Transport

3. Network

2. Data Link

1. Physical

TCP/IP Model (4 Layers)

Application

Transport (TCP/UDP)

Internet (IP)

Network Access

✅ Checkpoint

How many layers does OSI have vs TCP/IP? (Answer: 7 vs 4)

Switches vs Routers

⏱️ 15 min • Lecture 1.3

🔌 Switch

• Works at LAN/Link Layer
• Forwards based on MAC address
• Connects devices in same network

🌐 Router

• Works at IP/Network Layer
• Forwards based on IP address
• Connects different networks

🎉 Module 1 Complete!

You've learned network history, terminology, packet switching, layer models, and device differences. Take the quiz!

🔌

Module 2: Link Layer & Switching

Topology, Ethernet, CSMA, Collisions, Switches

Lectures 2.1, 2.2, 2.3 • Book: Chapter 1 (1.5–1.14), Chapter 2 (2.1–2.4)

🕸️

Network Topologies

━━━

Bus

Single cable

✳️

Star

Central hub

⭕

Ring

Circular

🕸️

Mesh

All connected

🌲

Tree

Hierarchical

🔀

Hybrid

Combined

🔌

Ethernet

• Invented 1973 at Xerox PARC by Bob Metcalfe
• Original: 10 Mbps coaxial cable
• Modern: 100 Mbps → 10 Gbps
• Link layer protocol for LANs

🏆 Metcalfe: 2022 Turing Award recipient

📨

Communication Types

Unicast: One → One (web, email)

Multicast: One → Group (streaming, gaming)

Broadcast: One → All (ARP, Wi-Fi discovery)

📋

Ethernet Frame Format

Preamble
64 bits

Dest MAC
48 bits

Src MAC
48 bits

Type
16 bits

Data
≤1500 B

CRC
32 bits

Type field values: 0x0800 (IPv4), 0x0806 (ARP), 0x86DD (IPv6)

👂

CSMA (Carrier Sense Multiple Access)

"Listen before you talk"

Sense for idle channel
If busy, wait until idle
Transmit and monitor for collision
If collision → abort → backoff → retry

🏝️

ALOHA Protocol

Developed in Hawaii (1970s) for packet radio

Pure ALOHA: Transmit immediately, retry on collision

Slotted ALOHA: Transmit only at fixed time slots (fewer collisions)

💥

Slot Time & Collisions

• Slot time: 512 bits (64 bytes) @ 10Mbps = 51.2 µsec
• Minimum packet: 64 bytes (to detect collisions)
• Collision detection time = 2× propagation delay

After 1 slot time with no collision = "acquired the network"

📈

Exponential Backoff Algorithm

After collision, wait k × 51.2 µs

N ≤ 10: k ∈ [0, 2^N)
N > 10: k ∈ [0, 1024)
N = 16: Give up!

Inter-packet gap: 96 bits (9.6 µs)

🔀

Ethernet Switches

Key Properties:

✅ Transparent: Hosts unaware of switches
✅ Self-learning: No configuration needed
✅ Full duplex: No collisions
✅ Store & forward: Examines frames before forwarding

Switch Table Entry:

{ MAC address, Interface, Timestamp }

If destination unknown → flood to all ports

🌐

IPv4 Addressing

• 32 bits = 4 octets (0-255 each)
• 4.3 billion possible addresses
• Format: 192.168.100.10

Network Part: Identifies network
Host Part: Identifies device in network

📖

DNS (Domain Name System)

• Translates domain names → IP addresses
• Hierarchical & distributed (not centralized!)
• Root → TLD (.com, .org) → Authoritative

www.amazon.com → Root → .com → amazon.com → IP

🔄

Routing Loops & TTL

Problem: Routing Loops

Packets circulate endlessly due to misconfigured routing tables

Solution: TTL (Time To Live)

• Initial value: usually 64
• Each router decrements by 1
• TTL = 0 → packet discarded

📊 Module 2 Diagrams

Topologies, Collisions, Switch Learning

Topology Comparison Chart

Topology	Cost	Reliability	Scalability	Best For
Bus	Low	Low	Poor	Small temporary networks
Star	Med	High	Good	Office LANs
Ring	Low	Med	Med	Token Ring networks
Mesh	High	Very High	Complex	Critical infrastructure
Tree	Med	Med	Good	Hierarchical orgs

Collision Detection Timeline

🖥️

5 units

🖥️

T=0 A starts sending "helloworld"

T=5 A's signal reaches B; B thinks line is idle, starts sending

T=10 💥 A detects collision (round-trip = 2× distance)

Key insight: Collision detection time = 2× propagation delay

Switch Self-Learning Process

Frame arrives

Switch examines source MAC address

Learn source location

Records: {MAC, Port, Timestamp} in switch table

Look up destination

Search table for destination MAC

Found → Forward to specific port

Not found → Flood to ALL ports (except source)

📋 Module 2 Key Formulas

Ethernet, Collisions, Backoff

Exponential Backoff Formula

Wait = k × 51.2 µs

Where k is randomly chosen from:

k ∈ [0, 2^N) when N ≤ 10

k ∈ [0, 1024) when N > 10

Give up after N = 16 attempts

Ethernet Timing Constants (10 Mbps)

51.2 µs

Slot time (512 bits)

9.6 µs

Inter-packet gap (96 bits)

64 bytes

Minimum frame size

1500 bytes

Maximum payload (MTU)

Collision Probability

Probability of re-collision between two hosts:

N=1
50%

N=2
25%

N=3
12.5%

N=10
~0.1%

IPv4 Subnet Mask Example

IP: 192.168.100.10/24

Subnet Mask: 255.255.255.0

192.168.100 . 10

Green = Network part (24 bits), Blue = Host part (8 bits)

🎯 Module 2 Quiz

Link Layer, Ethernet, Switches

1. What does CSMA stand for?

2. What is the minimum Ethernet frame size?

3. How does a switch learn MAC addresses?

4. After how many failed attempts does exponential backoff give up?

5. What does TTL prevent?

6. Which topology has the highest fault tolerance?

7. What does a switch do when it doesn't know the destination MAC?

🎓

Module 2: Lecture Walkthrough

Step-by-step guide through Link Layer & Switching

📖 Lectures 2.1, 2.2, 2.3 • Book: Chapter 1 (1.5–1.14), Chapter 2 (2.1–2.4)

📘 Lecture 2.1: Network Topology & Traffic Management

Physical and logical network layouts

2.1

Network Topologies

⏱️ 20 min • Physical layout patterns

🎯 Learning Goals

• Identify the 6 common network topologies
• Compare advantages and disadvantages of each
• Understand fault tolerance implications

🕸️ 6 Common Topologies

Bus
Single cable, low cost

Star
Central hub

Ring
Circular path

Mesh
All connected

Tree
Hierarchical

Hybrid
Combined

✅ Checkpoint

Which topology has highest fault tolerance? → Mesh - multiple paths to each device

📘 Lecture 2.2: Link Layer and Ethernet

Ethernet frames, CSMA/CD, and collision handling

2.2.1

Ethernet Fundamentals

⏱️ 25 min • History and frame format

🎯 Learning Goals

• Know Ethernet history and inventor
• Understand Ethernet frame structure
• Know minimum and maximum frame sizes

🔌 Ethernet History

• Invented 1973 at Xerox PARC by Bob Metcalfe
• Original: 10 Mbps coaxial cable
• Modern: 100 Mbps → 10 Gbps+
• Metcalfe: 2022 Turing Award recipient

📋 Frame Format

Preamble 64b Dest MAC 48b Src MAC 48b Type 16b Data ≤1500B CRC 32b

Min: 64 bytes | Max: 1518 bytes (with header)

✅ Checkpoint

What's the minimum Ethernet frame size? → 64 bytes (for collision detection)

2.2.2

CSMA/CD Protocol

⏱️ 25 min • Collision detection and handling

🎯 Learning Goals

• Explain the CSMA/CD algorithm steps
• Calculate collision detection time
• Understand exponential backoff

👂 CSMA = "Listen Before You Talk"

Sense if channel is idle
If busy, wait until idle
Transmit and monitor for collision
If collision → abort → backoff → retry

💥 Collision Detection

Collision detection time = 2× propagation delay (round-trip time)

This is why minimum frame size (64 bytes) is required

✅ Checkpoint

What does CSMA stand for? → Carrier Sense Multiple Access

2.2.3

Exponential Backoff

⏱️ 20 min • Collision recovery algorithm

🎯 Learning Goals

• Explain the exponential backoff formula
• Know when the algorithm gives up
• Calculate backoff ranges for different N

📈 The Algorithm

After collision #N, wait k × 51.2 µs

N ≤ 10: k ∈ [0, 2^N)
N > 10: k ∈ [0, 1024)
N = 16: Give up!

⏱️ Timing Constants (10 Mbps)

Slot time: 51.2 µs (512 bits)

Inter-packet gap: 9.6 µs

✅ Checkpoint

After how many failed attempts does the algorithm give up? → 16

📘 Lecture 2.3: Communication Protocols & Switches

Switch learning, forwarding, and IP basics

2.3.1

Ethernet Switches

⏱️ 25 min • Self-learning and forwarding

🎯 Learning Goals

• List the 4 key properties of switches
• Explain the self-learning process
• Know what "flooding" means

🔀 Switch Properties

✅ Transparent: Hosts unaware of switches
✅ Self-learning: No manual configuration
✅ Full duplex: No collisions between ports
✅ Store & forward: Examines frame before forwarding

📝 Self-Learning Process

Frame arrives → examine source MAC
Record {MAC, Port, Timestamp} in table
Look up destination MAC
Found → forward to specific port
Not found → flood to all ports (except source)

✅ Checkpoint

What does a switch do when it doesn't know the destination? → Floods to all ports except source

2.3.2

IP Addressing & TTL

⏱️ 20 min • Network layer basics

🎯 Learning Goals

• Know IPv4 address structure
• Understand the purpose of TTL
• Explain how TTL prevents routing loops

🌐 IPv4 Basics

• 32 bits = 4 octets (0-255 each)
• Example: 192.168.1.10
• 4.3 billion possible addresses
• Network part + Host part

🔄 TTL (Time To Live)

Prevents routing loops:

• Each router decrements TTL by 1
• Packet dropped at TTL=0
• Typical initial values: 64, 128, or 255

🎉 Module 2 Complete!

You've covered Lectures 2.1, 2.2, and 2.3. Take the quiz to test your knowledge!

🌐

Module 3: STP, VLAN & SDN

Spanning Tree Protocol, Virtual LANs, Software Defined Networking

Lectures 3.1, 3.2 • Book: Chapter 3 (3.1–3.4)

🌲

Spanning Tree Protocol (STP)

Prevents loops in Ethernet networks while ensuring redundancy

❌ The Problem: Loops

• Broadcast packets circulate endlessly
• Consumes bandwidth
• Leads to network failure

✅ The Solution: STP

• Creates loop-free subset
• Disables redundant links
• Recomputes if link fails

🧮

STP Algorithm (Radia Perlman)

• Root: Switch with smallest ID
• Path Selection: Shortest path to root wins
• Tie-breaker: Smaller switch ID
• Path cost = hops or 1/bandwidth

📨

Bridge Protocol Data Units (BPDU)

• "Hello" messages on all interfaces
• Multicast: 01:80:c2:00:00:00
• Contains: Switch ID, Root ID, Path cost

✂️

Interface Pruning Rules

Enable port connecting to root switch
Enable ports other switches use to reach root
Enable ports to segments where this switch has lowest cost (or smallest ID as tie-breaker)
Enable ports connecting directly to hosts

🏢

Virtual LAN (VLAN)

Logical network segments within a physical network

Security
Isolate sensitive data

Flexibility
Group by dept, not location

Broadcast
Reduce broadcast domain

Easy Changes
Reconfigure ports easily

🧠

Software Defined Networking (SDN)

Separates control plane from data plane

Traditional Networks

• Control & data plane integrated
• Manual configuration
• Vendor-dependent hardware

SDN-Based Networks

• Centralized control plane
• Automatic configuration
• Open, flexible control

📦

SDN Architecture

Application Layer: Apps requesting resources

Control Layer: SDN Controller (the "brain")

Data Plane: Switches/routers forwarding data

⚡

OpenFlow Protocol

First SDN standard for controller-switch communication

Packet arrives at switch
Switch asks controller for instructions
Controller decides action
Switch executes and updates flow table

⚖️

Load Balancers

Distributes incoming traffic across multiple servers

SDN + Load Balancing Example: Video conferencing app (Zoom) faces traffic spikes → SDN Controller detects congestion → OpenFlow reroutes traffic → Load Balancer distributes users → No lag!

📊 Module 3 Diagrams

Spanning Tree, SDN Architecture

Spanning Tree Example

Root

← ROOT (smallest ID)

← 1 hop from root ← 2 hops from root

Active spanning tree links

Disabled (pruned) links

Equal-cost paths use smaller switch ID as tie-breaker

SDN Three-Layer Architecture

Application Layer

Business Apps, Security, Analytics

↕ Northbound API

Control Layer

SDN Controller (Brain)

↕ Southbound API (OpenFlow)

Infrastructure Layer

Switches, Routers (Data Plane)

OpenFlow Multi-Table Learning

T0: Match Destination

Dst = A	→ Port 1, goto T1
Dst = B	→ Port 2, goto T1
No Match	→ Flood, goto T1

T1: Match Source

Src = A	→ Do nothing
Src = B	→ Do nothing
No Match	→ Send to controller

Multi-table approach avoids pair-based rules, reducing controller involvement

📋 Module 3 Key Formulas & Rules

STP, VLAN, SDN Reference

🌲 STP Root Selection

Root Switch = Switch with smallest ID
Path with lowest cost to root wins
If tied: smaller switch ID wins
If still tied: smaller port ID wins

🏢 VLAN Benefits

Security: Isolate sensitive hosts

Broadcast: Reduce broadcast domain size

Flexibility: Group by dept, not location

Easy changes: Reconfigure ports dynamically

🧠 SDN Planes

Control Plane: Decides where packets go (flow table updates)

Data Plane: Actually forwards packets based on flow table

⚡ OpenFlow Process

1. Packet arrives at switch

2. Check flow table for match

3. Match found → Execute action

4. No match → Ask controller → Install rule

📝 Key Addresses

BPDU Multicast:
01:80:c2:00:00:00

VLAN Forwarding:
Between VLANs requires routing

🎯 Module 3 Quiz

STP, VLAN, SDN

1. What problem does Spanning Tree Protocol solve?

2. Which switch becomes the STP root?

3. What is a primary benefit of VLANs?

4. What does SDN separate?

5. What protocol does OpenFlow use to communicate between controller and switches?

6. What happens when an OpenFlow switch receives a packet with no matching flow rule?

🎓

Module 3: Lecture Walkthrough

Step-by-step guide through STP, VLAN & SDN

📖 Lectures 3.1, 3.2 • Book: Chapter 3 (3.1–3.4)

📘 Lecture 3.1: Spanning Tree Protocol

Loop prevention and network redundancy management

3.1.1

The Loop Problem

⏱️ 15 min • Why loops break networks

🎯 Learning Goals

• Understand why network loops occur with multiple switches
• Explain how broadcast storms consume bandwidth
• Recognize the trade-off between redundancy and loops

❌ What Goes Wrong With Loops?

Consider this scenario: Switches S1-S5 are connected, and S5 has an additional link to S1 creating a loop.

• When A sends a broadcast (e.g., ARP request), every switch floods it
• The frame reaches S5 via S2, then S5 forwards to S1 via the redundant link
• S1 floods it again → endless circulation
• Result: 100% bandwidth consumed, network failure

💡 But Loops Provide Redundancy!

We WANT redundant paths for reliability - if one link fails, traffic can use another path. The solution: keep links but logically disable some during normal operation.

✅ Checkpoint

Why are loops problematic for broadcasts? → They circulate endlessly, consuming all bandwidth and causing network failure.

3.1.2

Spanning Tree Protocol Fundamentals

⏱️ 25 min • Algorithm and root selection

🎯 Learning Goals

• Explain how STP creates a loop-free topology
• Identify the root switch using switch IDs
• Understand path cost and selection criteria

🌲 What is a Spanning Tree?

• Definition: A loop-free subset of the network that spans all switches
• Created by Radia Perlman (1985)
• Disables redundant links (but keeps them physically connected)
• If an active link fails, the tree is recomputed, potentially activating disabled links

🔑 Root Bridge Selection

• Each switch has a unique ID (typically lowest MAC address)
• Switch with smallest ID becomes the ROOT
• Example: If you have S1, S2, S3, S4, S5 → S1 is root (1 is smallest)

📏 Path Selection Rules

Shorter path to root is preferred
If tied, use path through smaller switch ID
If still tied, use smaller port number

Path cost = number of hops (or inversely proportional to bandwidth)

✅ Checkpoint

Who invented STP? → Radia Perlman (1985)

How is the root selected? → Switch with the smallest ID

3.1.3

BPDU & Interface Pruning Rules

⏱️ 25 min • How switches communicate and decide

🎯 Learning Goals

• Understand BPDU contents and purpose
• Apply the 4 interface pruning rules
• Work through STP examples step by step

📨 Bridge Protocol Data Units (BPDU)

• "Hello" messages sent on ALL interfaces
• Multicast address: 01:80:c2:00:00:00 (only processed by switches)
• BPDU Contents:
- - Switch ID (sender)
- - Root ID (who sender thinks is root)
- - Path cost to root

🔄 Processing BPDUs - Switch Updates When:

• It learns of a new root candidate with lower ID
• It finds a shorter path to the existing root
• For equal paths: prefers neighbor with smaller switch ID
• If still tied: uses smaller port number

✂️ The 4 Interface Pruning Rules

Rule 1: Enable the port connecting TO the root switch
Rule 2: Enable ports that OTHER switches use to reach root through you
Rule 3: For shared segments with other switches:
- • Enable if YOUR switch has lowest cost to root
- • Tie-breaker: smallest switch ID
- • Still tied: smallest port ID
Rule 4: Enable ports connecting directly to hosts (no other switches on segment)

📝 Worked Example

Given switches S1-S6 where numbers = IDs:

S1 becomes root (smallest ID = 1)
S2, S4 are directly connected to S1 → enable those ports (Rule 1 & 2)
S3 reaches root via S2 → S3 enables port to S2, S2 enables port to S3
S5 has equal-cost paths via S2 and S4 → picks S2 (smaller ID)
S6 has equal-cost paths via S3 → picks S3
Disabled links: S4↔S5, S4↔S6 (redundant, not needed)

✅ Checkpoint

What's the tie-breaker when two paths have equal cost? → Smaller switch ID, then smaller port number

📘 Lecture 3.2: VLAN and SDN

Virtual LANs, Software Defined Networking, and OpenFlow

3.2.1

VLAN Concepts & Benefits

⏱️ 20 min • Understanding virtual network segmentation

🎯 Learning Goals

• Define what a VLAN is and how it differs from physical segmentation
• List the security and flexibility benefits of VLANs
• Understand that VLANs create separate broadcast domains

🏢 What is a VLAN?

• Virtual LAN: A logical network segment within a physical network
• Devices can be grouped together even if not on the same physical switch
• Each VLAN = separate broadcast domain
• Configured by assigning switch ports to specific VLANs

🔐 Key Benefits of VLANs

🔒 Security: Isolate sensitive data - devices in different VLANs cannot see each other's traffic

📉 Smaller Broadcasts: Reduce number of hosts receiving flooded frames

🔧 Flexibility: Group users by function/department, not physical location

⚡ Easy Changes: Move device to new VLAN by reconfiguring the port

💡 Key Insight: VLAN Isolation

Devices in different VLANs CANNOT communicate directly - they require a router (Layer 3 device) to forward traffic between VLANs. This is the same as if they were on completely separate physical networks.

✅ Checkpoint

How do devices in different VLANs communicate? → Through routing (Layer 3) - just like separate physical networks

3.2.2

🔬 VLAN Lab Guide: Designing Network Segmentation

⏱️ 45 min • Practical walkthrough for Packet Tracer labs

🎯 What You'll Learn

• How to analyze a scenario and identify VLAN requirements
• The systematic approach to VLAN design
• Configuring static IPs and switch ports in Packet Tracer
• Verifying isolation between VLANs

📋 Step 1: Analyze the Scenario

Read the requirements carefully and identify communication groups. Ask yourself:

• Who needs to talk to whom? (Same VLAN)
• Who must NOT communicate? (Different VLANs)
• How many distinct groups exist? (Number of VLANs needed)

Example Scenario Analysis:

"A small office has: 4 developers who need to share code, 3 HR staff with confidential employee data, and 2 executives with sensitive financial documents. All groups should be isolated from each other."

✅ Group 1: 4 developers (need to communicate)
✅ Group 2: 3 HR staff (need to communicate, isolated from others)
✅ Group 3: 2 executives (need to communicate, isolated from others)
→ 3 VLANs needed

🗺️ Step 2: Design Your VLAN Structure

Create a mapping table:

VLAN ID	Name	Devices	Switch Ports
VLAN 10	Development	Dev1, Dev2, Dev3, Dev4	Fa0/1 - Fa0/4
VLAN 20	HR	HR1, HR2, HR3	Fa0/5 - Fa0/7
VLAN 30	Executive	Exec1, Exec2	Fa0/8 - Fa0/9

💡 Tip: Use meaningful VLAN IDs (10, 20, 30...) rather than sequential (1, 2, 3) for easier management

🔢 Step 3: Assign IP Addresses

For labs requiring static IPs (e.g., 192.168.1.x with /24 subnet):

Desktop → IP Configuration → Static:

IP Address: 192.168.1.x (where x = unique number, NOT 0 or 1)
Subnet Mask: 255.255.255.0
Default Gateway: 192.168.1.1

VLAN 10

192.168.1.10

192.168.1.11

192.168.1.12

192.168.1.13

VLAN 20

192.168.1.20

192.168.1.21

192.168.1.22

VLAN 30

192.168.1.30

192.168.1.31

💡 Tip: Use VLAN ID as starting number (10, 11, 12... for VLAN 10) for easy identification

⚙️ Step 4: Configure the Switch

In Packet Tracer, click the switch → Config tab:

Create VLANs: VLAN Database → Add VLAN numbers and names
Assign ports: For each interface (FastEthernet0/1, etc.):
- • Set mode to Access
- • Assign to appropriate VLAN

# Example CLI commands (optional)

Switch(config)# vlan 10

Switch(config-vlan)# name Development

Switch(config)# interface fa0/1

Switch(config-if)# switchport mode access

Switch(config-if)# switchport access vlan 10

✅ Step 5: Verify Your Configuration

Test communication using PDU (packet) simulation:

✅ Same VLAN: Ping should SUCCEED between devices in same VLAN
❌ Different VLANs: Ping should FAIL between devices in different VLANs

Expected Results for our example:

✅ Dev1 → Dev2, Dev3, Dev4 (all VLAN 10) → SUCCESS
❌ Dev1 → HR1 (VLAN 10 → VLAN 20) → FAIL
❌ HR1 → Exec1 (VLAN 20 → VLAN 30) → FAIL

⚠️ Common Mistakes to Avoid

❌ Forgetting to assign ports to VLANs (they stay in default VLAN 1)
❌ Using IP 192.168.1.0 or 192.168.1.1 (reserved for network/gateway)
❌ Assigning same IP to multiple devices
❌ Wrong subnet mask (should be 255.255.255.0 for /24)
❌ Expecting different VLANs to communicate without a router

3.2.3

Software Defined Networking (SDN)

⏱️ 25 min • Separating control from data

🎯 Learning Goals

• Explain the difference between control plane and data plane
• Describe the three layers of SDN architecture
• List benefits of centralized network control

🧠 The Core Concept

Traditional Networking

Control plane + data plane are integrated in each device. Each switch/router makes its own decisions.

SDN Approach

Control plane is centralized in a controller. Switches just forward based on instructions.

📦 SDN Three-Layer Architecture

📱

Application Layer

Business apps that request network resources

🧠

Control Layer (SDN Controller)

The "brain" - makes all forwarding decisions centrally

🔌

Infrastructure Layer (Data Plane)

Physical switches that forward based on controller instructions

🎯 Benefits of SDN

• Centralized Control: No need to configure every switch manually
• Scalability: Easy to add new devices
• Cost-Effective: Use commodity switches + software controller
• Programmable: Change network behavior via software
• Used by: Google, AWS, Microsoft Azure for cloud networking

✅ Checkpoint

What does SDN separate? → Control plane from data plane

3.2.4

OpenFlow Protocol

⏱️ 25 min • The foundation of SDN communication

🎯 Learning Goals

• Understand how OpenFlow enables SDN
• Explain the flow table concept
• Compare basic vs. multi-table learning approaches

⚡ What is OpenFlow?

The first SDN standard protocol allowing controller-to-switch communication:

Packet arrives at switch
Switch checks flow table for matching rule
Match found → execute action (forward, drop, etc.)
No match → send to controller → controller installs new rule

📊 Basic Learning Process (Single Table)

• Stores rules as <destination, source> pairs
• A→B: Controller floods, learns A at port 1
• B→A: Controller learns B at port 2, installs rules
• Problem: If C sends to B, no matching rule exists (needs controller again)

📝 Multi-Table Optimization

Use two tables to reduce controller involvement:

T0: Match Destination

If match → forward, then check T1

If no match → flood, send to T1

T1: Match Source

If match → do nothing

If no match → send to controller

💡 Once paths are learned, controller is no longer involved!

🎉 Module 3 Complete!

You've mastered STP for loop prevention, VLAN design for network segmentation, and SDN/OpenFlow for programmable networks. Now take the quiz!

📻

Module 4: Wireless & Alternative LAN Technologies

Radioland, Wi-Fi, WiMAX/LTE, Satellite, VPN, Token Ring, Virtual Circuits

Lectures 4.1–4.5 • Book: Chapter 4

📡

Introduction to Radioland

• Radioland: Domain of wireless communication using radio waves
• Privacy Risk: Wireless signals easily intercepted (TJX breach)
• Collision Detection: Impractical over radio — signals too weak compared to transmitted signal
• Hidden Node Problem: Two nodes out of range of each other can collide at a receiver between them

📊

Bandwidth, SNR & Data Rate

• Bandwidth: Frequency range (channel width) used by a signal
• SNR: Signal-to-Noise Ratio — strength vs background noise
• Shannon's Formula:

Max Data Rate = Channel Width × log₂(1 + SNR)

• Multipath: Signal reaches receiver via multiple paths (line-of-sight + reflections)

📶

Wi-Fi (IEEE 802.11)

• Protocols: 802.11a/b/g/n/ac/ax
• MAC addresses: 48-bit, same namespace as Ethernet
• Cannot detect collisions in progress (unlike Ethernet)
• Uses ACK packets — no ACK = assume collision
• Interoperable with Ethernet via Access Points

⚡

Wi-Fi Collision Avoidance

• DIFS/IFS: 50 µsec wait before transmitting
• SIFS: 10 µsec wait before ACK
• Slot Time: 20 µsec
• Exponential Backoff: Start 0-31 slots; doubles up to 1024; 7 failures = discard
• RTS/CTS: Request-to-Send / Clear-to-Send to reserve channel

RTS/CTS solves hidden-node: B hears CTS from C and knows to wait.

📡

MIMO Technology

• MIMO: Multiple-Input-Multiple-Output — multiple simultaneous data streams
• Both sender & receiver have N antennas for N streams
• SIMO: Single-Input-Multiple-Output (receiver picks stronger signal)
• MISO: Multiple-Input-Single-Output (transmitter selects best antenna)
• Works well in environments with multipath interference; ineffective in clear space

🏠

Wi-Fi Configurations & Security

• Infrastructure Mode: Devices communicate through the AP (most common)
• Ad Hoc Mode: Devices communicate directly (MANETs)
• SSID: Network name (human-readable in infrastructure mode)
• ESS: Extended Service Set — multiple APs, single SSID, enables roaming
• WPA2: AES encryption + CCMP; uses pre-shared key (PSK)
• KRACK Attack: Exploits key reinstallation in WPA2 handshake
• WPA2-Enterprise: Unique key per device, RADIUS server

📈

Wi-Fi Rate Scaling

• Adjusts transmission bit rates based on connection quality
• 802.11g rates: 54, 48, 36, 24, 18, 12, 9, 6 Mbps
• ARF: Rate ↓ after 2 failures, ↑ after 10 successes
• RBAR: Uses SNR to select rate
• CARA: Collision-Aware Rate Adaptation
• Goal: Maximize throughput, not just speed

📱

WiMAX & LTE

• Both marketed as 4G
• WiMAX (802.16): Licensed or unlicensed spectrum; range up to tens of km
• LTE: Licensed spectrum only; developed by mobile telecom industry
• Coverage: LTE/WiMAX 1-10 km; Wi-Fi <100 m
• Use scheduling instead of contention (unlike Wi-Fi)
• LTE RACH: Random preamble for network entry; collision = retry

🛰️

Satellite Internet

• GEO: Geosynchronous orbit at 35,786 km; RTT ~1000 ms
• Parabolic dishes 70-100 cm; pointed once during installation
• LEO: Low Earth Orbit 500-1500 km; much lower RTTs
• Starlink: ~7,000 LEO satellites by SpaceX
• ISPs offer "acceleration" for bulk downloads but not interactive traffic

🔒

VPN (Virtual Private Network)

• Creates a tunnel between remote host and office LAN via the Internet
• Virtual interface (tun0) assigned a site-local IP address
• VPN client encrypts → sends over regular Internet → VPN server decrypts
• Home computer appears locally connected to office network
• Can also connect entire remote offices to HQ
• Other uses: geographic restrictions bypass, anonymous browsing

💍

Token Ring & Virtual Circuits

💍 Token Ring (IBM, 1980s)

• "Whoever holds the token can talk"
• Contention-free: no collisions by design
• Lost to Ethernet (simpler, cheaper, scalable)

🔀 Virtual Circuits

• Routers know about end-to-end connections
• Packets addressed by VCI (Virtual Circuit Identifier)
• Connection established before data sent
• VCIs locally unique — may differ on each link
• vs Datagram: state-aware, QoS guarantees, smaller headers

📊 Module 4 Diagrams & Models

Wireless communication visual aids

RTS/CTS Protocol — Solving Hidden-Node Problem

A
Sender

C
Receiver

B
Hidden Node

1. A → C: RTS (Request to Send)

2. C → All: CTS (Clear to Send) — B hears this!

3. A → C: DATA (after SIFS interval)

4. B waits — CTS contains data packet size (knows how long)

5. C → A: ACK

Wi-Fi Timing Intervals

SIFS

µsec

Slot Time

µsec

DIFS (IFS)

µsec

Key Rule: Receiver waits SIFS (short) before ACK. Other stations wait DIFS (longer) before transmitting — prevents interference.

Wireless Coverage Comparison

Wi-Fi

<100 m

LTE/WiMAX

1–10 km

WiMAX Fixed

Tens of km

Satellite

35,786 km

VPN Tunnel Architecture

🏠 Home

eth0 (public IP)

tun0 (Site A IP)

🌐 Internet

Encrypted tunnel

(TCP/UDP)

🏢 Office (Site A)

VPN Server

Office LAN

Home computer gets Site A IP → appears locally connected to office network

📋 Module 4 Key Formulas & Facts

Wireless networking essentials

Shannon-Hartley Theorem

Max Data Rate = Channel Width × log₂(1 + SNR)

SNR = 127, Width = 1 MHz → 7 Mbps

SNR = 63, Width = 1 MHz → 6 Mbps

Wi-Fi Exponential Backoff

1st: 0–31 slots

2nd: 0–63 slots

3rd: 0–127 slots

Max: 0–1023 slots

After 7 failed attempts, packet is discarded.

Critical Wi-Fi Timing

⏱️ SIFS: 10 µsec (short, for ACKs)
⏱️ Slot Time: 20 µsec
⏱️ DIFS: 50 µsec (before new transmission)
📡 Wi-Fi Range (100m): RTT < 1 µsec

Rate Scaling — ARF Algorithm

• Rate decreases after 2 consecutive failures
• Rate increases after 10 consecutive successes
• Failure = missing link-layer ACK
• 802.11g rates: 54, 48, 36, 24, 18, 12, 9, 6 Mbps

Satellite RTT Comparison

• GEO (35,786 km): ~1000 ms typical RTT
• Speed-of-light delay alone: ~500 ms
• LEO (500-1500 km): RTT closer to terrestrial Internet

🎓

Module 4: Lecture Walkthrough

Step-by-step through Wireless & Alternative LAN Technologies

📖 Lectures 4.1–4.5 • Book: Chapter 4 (4.1–4.4)

📘 Lecture 4.1: Introduction to Radioland

Wireless basics, SNR, multipath, privacy

🔑 Key Concepts

• Wireless = radio waves for data, signals, broadcasts
• Privacy: wireless easily intercepted (TJX breach — directional antenna)
• Collision detection impractical: can't sense weak remote signals while transmitting
• Hidden nodes: A and B can't hear each other but both collide at C
• Shannon's formula determines max data rate from SNR and bandwidth
• Multipath: signal arrives via line-of-sight + reflected paths

📘 Lectures 4.2–4.3: Wi-Fi Deep Dive

Collision avoidance, RTS/CTS, MIMO, APs, security

📶 Wi-Fi Core Protocol

• 802.11 family: a/b/g/n/ac/ax — all interoperable with Ethernet
• No collision detection → uses ACK-based confirmation
• No ACK received → assume collision → exponential backoff
• Backoff range: starts 0-31, doubles to max 1024, discard after 7 failures
• RTS/CTS: optional protocol for large packets; solves hidden-node problem

📡 MIMO & Access Points

• MIMO: N antennas = N simultaneous data streams
• Infrastructure mode: through AP (true LAN, most common)
• Ad hoc mode: direct peer-to-peer (MANETs)
• SSID = network name; ESS = multiple APs, one SSID for roaming

🔐 Wi-Fi Security

• WPA2: AES + CCMP; pre-shared key (PSK) for personal networks
• Four-way handshake: nonces + MIC + PTK + GTK
• KRACK: attacker delays message → key reinstallation → keystream reuse
• WPA2-Enterprise: RADIUS server, unique key per device
• MAC randomization: privacy protection against tracking

📘 Lecture 4.4: WiMAX, LTE & Satellite

MANETs, cellular, terrestrial wireless, satellite orbits

📱 WiMAX vs LTE

• Both "4G"; WiMAX = IEEE 802.16, LTE = telecom industry
• WiMAX: licensed or unlicensed spectrum; LTE: licensed only
• Scheduling-based (not contention) — uplink slots are assigned
• Ranging: adjusts timing so signals arrive synchronized at base station
• LTE RACH: random preamble entry; collision = retry in next slot

🛰️ Satellite & Terrestrial Wireless

• GEO: 35,786 km, speed-of-light RTT ~500ms, typical ~1000ms
• LEO: 500-1500 km, much lower RTTs (Starlink: ~7,000 satellites)
• Terrestrial wireless: tower-mounted, radius under 10 miles typically
• Popular in rural areas where cable is uneconomical

📘 Lecture 4.5: VPN, Token Ring, Virtual Circuits

Alternative LAN technologies and long-distance connectivity

🔒 VPN Architecture

• Creates virtual tunnel over regular Internet (TCP/UDP)
• Virtual interface tun0 gets site-local IP address
• Encryption/decryption at client/server endpoints
• Home forwarding table routes site traffic via tun0

💍 Token Ring vs 🔀 Virtual Circuits

• Token Ring: contention-free; token holder transmits; died 1990s (vs Ethernet)
• Virtual Circuits: routers know connections; VCI per link; connection-oriented
• VC tables: inbound (VCI,port) → outbound (VCI,port)
• VC pros: QoS guarantees, small headers, voice optimization
• Datagram pros: less state, crash recovery, easy rerouting

🎯 Module 4 Quiz

Wireless Networking & Alternative LAN Technologies

1. Why is collision detection impractical in wireless networks?

2. In Wi-Fi, what does a sender assume if it does not receive an ACK?

3. What protocol solves the hidden-node problem in Wi-Fi?

4. MIMO works best in environments with:

5. What is the approximate RTT for geosynchronous satellite Internet?

6. In a VPN, the virtual interface (tun0) is assigned:

7. Why did Token Ring lose to Ethernet?

🌍

Module 5: The Network Layer

IP Protocol, Fragmentation, Routing, Subnets, DHCP, NAT, IPv6, DNS, ARP, ICMP

Lectures 5.1–5.7 • Book: Chapter 5, 7, 9

🌍

Internet Protocol (IP)

• "The Internet IS the IP protocol"
• Defines packet format, addressing scheme, routing method
• Best effort: No guaranteed delivery, no state, no ACKs
• Independent of layers above and below
• Analogy: Postal system — correct address → delivered

📋

IPv4 Header Fields

• Version: IPv4 = 0100
• IHL: Header length in 32-bit words
• Total Length: Entire packet in bytes
• TTL: Decremented at each hop; dropped at 0
• Protocol: What upper-layer protocol (TCP/UDP)
• Checksum: Header integrity validation
• Source/Dest: 32-bit IP addresses
• DS/ECN: QoS and congestion notification

🔨

IP Fragmentation

• Needed when MTU of next hop is smaller than packet
• Example: Token Ring (4KB MTU) → Ethernet (1500B MTU)
• Uses ID, flags, fragment offset fields in header
• Reassembled at destination, not at intermediate routers
• IPv6 difference: Only source fragments, not routers

🏷️

IP Addressing

• IP belongs to interface, not host
• Loopback: 127.0.0.1 (localhost)
• Private ranges: 10.0.0.0/8, 172.16.0.0/12, 192.168.0.0/16
• Broadcast: all host bits = 1 (e.g., 192.168.0.255)
• /24 network: 254 usable hosts (not 256 — broadcast + network)

⚠️

IP Spoofing & Smurf Attack

• Source address can be spoofed — local router won't check
• Smurf Attack: Send ICMP echo with victim's IP as source
• Fake ping sent to many servers → all replies flood the victim
• Distributed Denial of Service (DDoS) attack

🛣️

Subnets & IP Routing

• Subnet: Smaller IPv4 network within a larger organization
• Forwarding algorithm: Match first k bits of destination → local? → send. Not local? → forwarding table, longest prefix match
• Hierarchical routing: Outside → org gateway → subnet router → host

📡

DHCP

• Dynamic Host Configuration Protocol
• Four-step: Discover → Offer → Request → ACK
• DHCP server usually in router/AP
• Automatically assigns IP to joining hosts
• ICANN manages global IP allocation → 5 RIRs (ARIN, APNIC, etc.)

🔄

NAT (Network Address Translation)

• One public IP shared among multiple internal hosts
• Home Wi-Fi router = NAT router
• Outgoing: replaces source IP with router's public IP
• Uses port numbers to track connections
• Two internal hosts → same external host? → remap port
• Security benefit: external sites can't scan internal hosts

🔢

IPv6

Key Features

• 128-bit addresses (vs 32-bit IPv4)
• Fixed 40-byte header (simpler than IPv4)
• No header checksum (faster processing)
• Mandatory IPsec
• SLAAC: Auto-configure own IP
• Fragmentation only at source, not routers

Address Format

• 8 groups of 4 hex digits, separated by colons
• Leading zeros removed: 0023 → 23
• Consecutive zeros: use :: (once only)
• Loopback: ::1
• Types: unicast, multicast, anycast

2001:0db8:0000:0000:0000:ff00:0042:8329
→ 2001:db8::ff00:42:8329

🔍

DNS (Domain Name System)

• Hostname → IP address translation
• Distributed hierarchical database
• Root → TLD → Authoritative → Local
• 13 logical root servers worldwide
• Iterated query: "Ask this server instead"
• Recursive query: Server resolves on your behalf
• DNSSEC: Authentication and integrity for DNS

📬

ARP & ICMP

• ARP: IP address → MAC address resolution
• ARP table: <IP, MAC, TTL> entries (TTL ~20 min)
• ARP request: broadcast (FF-FF-FF-FF-FF-FF)
• ARP reply: unicast with MAC address
• ICMP: Network-layer control messages
• ping = echo request (type 8) / echo reply (type 0)
• traceroute: Uses TTL + ICMP Type 11 (TTL expired)
• MAC address: like SSN (permanent); IP: like postal address (location-based)

📊 Module 5 Diagrams & Models

Network Layer visual references

NAT (Network Address Translation) Flow

Internal Hosts

192.168.0.5

192.168.0.6

192.168.0.7

NAT Router

Internal: 192.168.0.1

Public: 200.1.2.37

Rewrites source IP
+ tracks ports

External Server

213.25.63.25:80

Sees only router's IP

Outgoing: Source 192.168.0.6:3000 → rewritten to 200.1.2.37:3000
Incoming: Dest 200.1.2.37:3000 → rewritten to 192.168.0.6:3000
Port Conflict: Two hosts same external port? NAT remaps (e.g., 3000→3001)

DHCP Four-Step Process

1. DHCP Discover (broadcast)

↓

2. DHCP Offer (server responds)

↓

3. DHCP Request (host accepts)

↓

4. DHCP ACK (server confirms)

IPv4 vs IPv6 Comparison

IPv4

• 32-bit addresses
• ~4.3 billion addresses
• Variable header length
• Header checksum
• Routers fragment packets
• Options in header

IPv6

• 128-bit addresses
• 340 undecillion addresses
• Fixed 40-byte header
• No header checksum
• Only source fragments
• Extension headers

DNS Hierarchy

Root DNS (13 logical servers)

↓

TLD Servers (.com, .edu, .org, .uk)

↓

Authoritative DNS (amazon.com, nyu.edu)

↓

Local DNS Server (ISP, cached)

Client → Local DNS → Root → TLD → Authoritative → IP returned

ARP Protocol in Action

1. A wants to send datagram to B (B's MAC unknown)

2. A broadcasts ARP query (dest MAC: FF-FF-FF-FF-FF-FF)

3. B receives query, replies with its MAC address (unicast)

4. A adds B's entry to ARP table (IP → MAC, TTL ~20 min)

📋 Module 5 Key Formulas & Facts

Network Layer essentials

IP Address Calculations

/24 network

2⁸ – 2 = 254 usable hosts

(minus network addr + broadcast)

/16 network

2¹⁶ – 2 = 65,534 usable hosts

Private IP Ranges

10.0.0.0/8
Class A

172.16.0.0/12
Class B

192.168.0.0/16
Class C-like

IPv6 Address Shortening

Full: 2001:0db8:0000:0000:0000:ff00:0042:8329

Remove leading zeros: 2001:db8:0:0:0:ff00:42:8329

Collapse zeros: 2001:db8::ff00:42:8329

Rule: :: can only appear ONCE

Critical Numbers

🌐 IPv4: 32 bits → 4.3 billion addresses
🔢 IPv6: 128 bits → 340 undecillion addresses
📦 IPv4 header: 20 bytes minimum
📦 IPv6 header: 40 bytes fixed
📡 Ethernet MTU: 1500 bytes
📋 ARP TTL: ~20 min
🌍 DNS root servers: 13 logical
🏷️ MAC address: 48 bits

ICMP Types to Know

Type 0: Echo Reply (ping response)

Type 3: Destination Unreachable

Type 8: Echo Request (ping)

Type 11: TTL Expired (traceroute)

🎓

Module 5: Lecture Walkthrough

The Network Layer — IP through DNS

📖 Lectures 5.1–5.7 • Book: Chapters 5, 7, 9

📘 Lecture 5.1: The Internet Protocol

IP basics, header fields, best effort delivery

🔑 Core Concepts

• IP = standard packet format + global addressing + routing
• Best effort: no delivery guarantees, no state, no ACKs
• IPv4 header: version, IHL, TTL, protocol, checksum, source/dest IP
• TTL prevents infinite loops — decremented at each hop
• Source IP can be spoofed → enables Smurf DDoS attack

📘 Lecture 5.2: IP Fragmentation & Addresses

MTU, fragmentation, IP classes, special addresses

📦 Fragmentation & Addressing

• Fragmentation when packet exceeds next-link MTU
• IP address = interface address (not host address)
• Loopback: 127.0.0.1 — always points to self
• Private: 10.0.0.0/8, 172.16.0.0/12, 192.168.0.0/16
• Broadcast: all host bits = 1 (e.g., 192.168.0.255)
• /24 = 254 usable hosts (broadcast + network addr used)

📘 Lecture 5.3: IP Routing & Subnets

Forwarding algorithm, longest prefix match, hierarchical routing

🛣️ Routing & Subnets

• Router checks first k bits of destination against interface B/k
• Match → local delivery; No match → forwarding table
• Longest prefix match wins for overlapping routes
• Subnets: divide large org network into smaller manageable units
• Hierarchical: outside → gateway → subnet router → host

📘 Lectures 5.4–5.5: DHCP & NAT

Dynamic addressing and address translation

📡 DHCP & 🔄 NAT

• DHCP: Discover → Offer → Request → ACK
• Managed by ICANN → 5 RIRs (ARIN, APNIC, RIPE, LACNIC, AFRINIC)
• NAT: one public IP, many internal hosts; port-based demuxing
• Outgoing: rewrite source to router's public IP
• Port remapping resolves conflicts (same external host)
• Security: external hosts cannot scan internal network

📘 Lectures 5.6–5.7: IPv6, ICMP, DNS, ARP

Next-gen IP, control plane, name resolution, address resolution

🔢 IPv6 & Control Plane

• 128-bit addresses; 40-byte fixed header; no checksum
• SLAAC auto-configuration; mandatory IPsec
• Hop Limit (like TTL); Flow Label for consistent routing
• Extension headers: Hop-by-Hop, Routing, Fragment, Destination
• ICMP: ping (8/0), traceroute (TTL expired = type 11)
• DNS: hierarchical (Root → TLD → Authoritative), iterated vs recursive
• ARP: broadcast query → unicast reply → cache with 20min TTL
• MAC = SSN (permanent), IP = postal address (location-dependent)

🎉 Module 5 Complete!

You've covered the entire Network Layer: IP, fragmentation, routing, DHCP, NAT, IPv6, DNS, ARP, and ICMP. Now take the quiz!

🎯 Module 5 Quiz

The Network Layer — IP, NAT, IPv6, DNS, ARP