←Back to Subject
Notes
Notes
Study material and explanations
Diagrams
Diagrams
Visualize concepts easily
Mnemonics
Mnemonics
Tricks to remember faster
One Night Prep
One Night Prep
Short and focused revision
Revision
Revision
Quick summary and key points
Important Questions
Important Questions
Practice most relevant questions
Notes

Internetworking Problems & Solutions: Fragmentation, NAT, Leaky Bucket

Study material and explanations for Unit 5

Internetworking Challenges and Solutions: Fragmentation, Congestion Control, NAT, and IPv6

When thousands of diverse networks connect together, four fundamental engineering problems arise: Packet Fragmentation, Traffic Congestion, IPv4 Address Exhaustion, and Protocol Differences.


1. Packet Fragmentation and MTU

Every physical network has a hard limit on the maximum packet size it can carry, called the Maximum Transmission Unit (MTU):

  • Standard Ethernet MTU = 1500 Bytes.
  • FDDI MTU = 4352 Bytes.

The Fragmentation Problem:

If a router receives a 4000-byte packet from an FDDI network and must forward it onto an Ethernet cable (max 1500 bytes), what happens?

  • The router splits the giant packet into multiple smaller fragments.
  • Each fragment gets its own IP header with identical Identification number, a Fragment Offset (indicating where the piece belongs), and the More Fragments (MF) flag.
  • The destination computer reassembles all pieces back into the original 4000-byte packet before handing it to the application layer.

2. Congestion Control: Leaky Bucket vs. Token Bucket

When too many packets enter a router at once, its memory buffer fills up and it starts dropping packets (Congestion). Two famous traffic-shaping algorithms solve this:

Traffic Shaping Algorithms
🪣 1. Leaky Bucket Algorithm
  • Imagine a water bucket with a small hole in the bottom.
  • No matter how irregularly water is poured in, water leaks out at a constant, smooth rate.
  • If bucket overflows, excess packets are discarded.
  • Result: Completely smooth output; cannot handle bursty traffic.
🪙 2. Token Bucket Algorithm
  • Tokens are generated by a clock and placed in a bucket at a fixed rate.
  • To transmit a packet, a computer must grab a token from the bucket.
  • If the bucket has accumulated 10 tokens, the computer can transmit a burst of 10 packets immediately!
  • Result: Allows controlled bursts of traffic without dropping packets.

3. IPv4 Address Exhaustion and Solutions: NAT and IPv6

IPv4 only has 2^32 ≈ 4.3 billion total addresses. With smartphones, laptops, smart TVs, and IoT sensors everywhere, the world completely ran out of unique IPv4 addresses!

Solution 1: NAT (Network Address Translation)

  • Allows an entire college or home (with 500 computers) to share one single public IP address on the Internet.
  • Computers inside the lab use private IPs (192.168.x.x). The Wi-Fi router translates between private internal IPs and the single external public IP using port numbers (PAT).

Solution 2: IPv6 (The Permanent Solution)

  • Upgrades address length from 32 bits to 128 bits.
  • Provides 2^128 ≈ 3.4 × 10^38 addresses (enough to assign billions of unique IP addresses to every grain of sand on planet Earth!).
  • Written in 8 groups of 4 hexadecimal digits separated by colons (e.g., 2001:0db8:85a3:0000:0000:8a2e:0370:7334).

💡 DAVV Exam Tip

Question (10 Marks): “Explain Leaky Bucket and Token Bucket algorithms with diagrams. Why do we need IPv6? Differentiate IPv4 and IPv6.”

  • Draw the water bucket diagram for Leaky Bucket and token box for Token Bucket.
  • Highlight that Token Bucket allows traffic bursts while Leaky Bucket forces a rigid constant rate.
  • Contrast IPv4 (32 bits, decimal) vs IPv6 (128 bits, hexadecimal).