Skip to main content

IPv4 vs IPv6: Packet structures and difference between ipv4 and ipv6


IPv4 vs IPv6: Significant Size Difference

There is significant difference in size between IPv6 and IPv4 addresses. IPv6 addresses, being 128 bits in length, indeed offer a vastly larger address space compared to IPv4’s 32-bit addresses. This expanded address space allows for an exponentially greater number of unique addresses, ensuring that devices connected to the Internet will not face the issue of address exhaustion, which was becoming a concern with IPv4 due to the rapid growth of internet-connected devices worldwide.

It effectively distinguishes between the roles of IP addresses and MAC addresses in networking. IP addresses serve as identifiers for devices within a network and are akin to postal codes, directing data packets to their intended destinations on the Internet. MAC addresses, on the other hand, are unique identifiers assigned to network interface cards (NICs) and function as hardware addresses within a local network. They play a crucial role in local network communication, ensuring that data is correctly routed to the intended device within the network. While IP addresses are visible to the broader Internet and are essential for global communication, MAC addresses operate at a lower level and are primarily used for communication within a local network.

IPv4 and IPv6 have a significant size difference, mainly in address length and packet header size.

1. Address size (the big difference)

  • IPv4: 32 bits
    Example: 192.168.1.1
    Total addresses: about 4.3 billion
  • IPv6: 128 bits
    Example: 2001:0db8:85a3::8a2e:0370:7334
    Total addresses: about 3.4 × 1038

➡️ IPv6 addresses are 4× longer in bits and astronomically more numerous.

2. Packet header size

  • IPv4 header:
    • Minimum: 20 bytes
    • Maximum: 60 bytes (due to optional fields)
  • IPv6 header:
    • Fixed: 40 bytes
    • No header options (uses extension headers instead)

➡️ IPv6 headers are larger than the minimum IPv4 header, but simpler and more predictable.

3. Efficiency trade-off

Feature IPv4 IPv6
Address size32 bits128 bits
Header size20–60 bytes40 bytes
Header complexityVariableFixed
NAT neededCommonNot required
Routing efficiencyLowerHigher

Even though IPv6 headers are bigger, routing is often faster because:

  • Fixed header size
  • Fewer fields to process
  • No checksum in the header

4. Is the size difference “significant” in practice?

  • Yes for:
    • Address storage
    • Logs and databases
    • Human readability
  • Usually no for:
    • Network performance on modern links
    • Bandwidth usage (40 bytes is tiny compared to typical packet sizes)

Summary

  • IPv6 uses much larger addresses
  • IPv6 headers are larger but simpler
  • The size increase enables massive scalability and cleaner networking

Structural Bit Calculation of IPv4 and IPv6

Yes. Let’s calculate the number of bits step-by-step using the actual structure of IPv4 and IPv6 addresses. This is the clearest justification.

IPv4: Structural Bit Calculation

Example IPv4 Address

192.168.1.1

Total:IPv4 = 32 bits

IPv6: Structural Bit Calculation

2001:0db8:85a3:0000:0000:8a2e:0370:7334
8 × 16 bits = 128 bits

IPv6 = 128 bits

 

What is the main difference between IPv4 and IPv6?


IPv4 was introduced in the 1970s. You may be aware that once we connect our devices to the internet, they are assigned a unique id. More specifically, when two routers begin communicating, they are assigned a unique IP address. Then our gadgets, such as PDAs, computers, and other mobile devices, connect to the internet via nearby routing devices. There could be a lot of intermediary routers in front of them. The main differences between IPv4 and IPv6 systems are discussed in this article. 


We know that IPv4 applications can still be used in IPv6 networks. Because the IPv6 system is backwards compatible with the IPv4 system. When you buy new hardware, it comes pre-configured with IPv6.



Difference in number of addressing bits in IPv4 vs. IPv6

IPv4 addresses are 32 bits long, while IPv6 addresses are 128 bits long. You may be aware that the number of internet-connected gadgets is currently 5-6 times the total number of people on the planet. To assign IP addresses to all devices, IPv4 is insufficient. On the other hand, the number of internet-connected gadgets is rapidly increasing. In this condition, IPv4 can only provide IP addresses to about 20% of the world's population.

IPv4 can only assign IP addresses to 2^(32) devices, however IPv6 can assign IP addresses to 2^(128) devices. If you tally up the numbers, you'll realize that we can assign IPv6 addresses to each and every sand particle in deserts. 



IPv4 vs. IPv6 Header Differences

The IPv4 header is 24 bytes long. We need only 8 bytes for source and destination addresses, and the remaining 16 bytes are used for 12 extra fields. The IPv6 header is only 40 bytes long. The source address is 16 bytes long, the destination address is 16 bytes long, and the header generation portion is 8 bytes long. In comparison to IPv4 networks, IPv6 networks employ a simpler header.



IPv6 has an auto-configuration feature

One of the most significant advantages is that IPv6 is auto-configurable. If you're familiar with IP addresses, you'll notice that devices connected to the same routers use the same prefixes. It is not auto-configurable for IPv4. In the case of IPv6, however, IP addresses are automatically assigned. In this situation, the router sends a prefix link, and connected devices are immediately assigned IP addresses with the same prefix.



IP addresses in IPv4 and IPv6 examples

IPv6 addresses are 128 bits long. Each sub block of the address block is split into eight sub blocks. Each portion has a 16-bit hexadecimal value. As an example,

Example of 128 bit IPv6 addresses 

2010:0BB8:0000:0000:1212:A3AA:0FEF:0714

The IP address given above can be written as

2010:BB8:0:0:1212:A3AA:FEF:714

2010:BB8: : 1212:A3AA:FEF:714

In IPv6, consecutive zeros can be replaced with "::" as illustrated above.


We've already talked abut that the IPv6 network system can still utilize IPv4 addresses. I'll show how IPv4 addresses are represented in IPv6 networks.

For instance, consider the IPv4 address 192.168.0.3. Then, with IPv6, it's referred as 

0:0:0:0:0:0:192.168.0.3

: : 192.168.0.3



How to find out what your internet-connected device's IP address is

When your device is connected to the internet, there are a number of websites where you can check your IP address. You may find your IP address by typing URL address "https://www.iplocation.net" into your browser.

What are the valid ipv6 addresses that can be used for communication across the Internet?




People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

Constellation Diagrams of ASK, PSK, and FSK with MATLAB Code + Simulator

📘 Overview of Energy per Bit (Eb / N0) 🧮 Online Simulator for constellation diagrams of ASK, FSK, and PSK 🧮 Theory behind Constellation Diagrams of ASK, FSK, and PSK 🧮 MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 📚 Further Reading 📂 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 🧮 Simulator for constellation diagrams of m-ary PSK 🧮 Simulator for constellation diagrams of m-ary QAM BASK (Binary ASK) Modulation: Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1.    BFSK (Binary FSK) Modulation: Transmits one of two signals: +√Eb​ ( On the y-axis, the phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...

Fading : Slow & Fast and Large & Small Scale Fading (with MATLAB Code + Simulator)

📘 Overview 📘 LARGE SCALE FADING 📘 SMALL SCALE FADING 📘 SLOW FADING 📘 FAST FADING 🧮 MATLAB Codes 📚 Further Reading LARGE SCALE FADING The term 'Large scale fading' is used to describe variations in received signal power over a long distance, usually just considering shadowing.  Assume that a transmitter (say, a cell tower) and a receiver  (say, your smartphone) are in constant communication. Take into account the fact that you are in a moving vehicle. An obstacle, such as a tall building, comes between your cell tower and your vehicle's line of sight (LOS) path. Then you'll notice a decline in the power of your received signal on the spectrogram. Large-scale fading is the term for this type of phenomenon. SMALL SCALE FADING  Small scale fading is a term that describes rapid fluctuations in the received signal power on a small time scale. This includes multipath propagation effects as well as movement-induced Doppler fr...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   Start Simulator for binary ASK Modulation Message Bits (e.g. 1,0,1,0) Carrier Frequency (Hz) Sampling Frequency (Hz) Run Simulation Simulator for binary FSK Modulation Input Bits (e.g. 1,0,1,0) Freq for '1' (Hz) Freq for '0' (Hz) Sampling Rate (Hz) Visualize FSK Signal Simulator for BPSK Modulation ...

Theoretical BER vs SNR for binary ASK, FSK, and PSK with MATLAB Code + Simulator

📘 Overview & Theory 🧮 MATLAB Codes 📚 Further Reading Theoretical BER vs SNR for Amplitude Shift Keying (ASK) The theoretical Bit Error Rate (BER) for binary ASK depends on how binary bits are mapped to signal amplitudes. For typical cases: If bits are mapped to 1 and -1, the BER is: BER = Q(√(2 × SNR)) If bits are mapped to 0 and 1, the BER becomes: BER = Q(√(SNR / 2)) Where: Q(x) is the Q-function: Q(x) = 0.5 × erfc(x / √2) SNR : Signal-to-Noise Ratio N₀ : Noise Power Spectral Density Understanding the Q-Function and BER for ASK Bit '0' transmits noise only Bit '1' transmits signal (1 + noise) Receiver decision threshold is 0.5 BER is given by: P b = Q(0.5 / σ) , where σ = √(N₀ / 2) Using SNR = (0.5)² / N₀, we get: BER = Q(√(SNR / 2)) Theoretical BER vs ...

DFTs-OFDM vs OFDM: Why DFT-Spread OFDM Reduces PAPR Effectively (with MATLAB Code)

DFT-spread OFDM (DFTs-OFDM) has lower Peak-to-Average Power Ratio (PAPR) because it "spreads" the data in the frequency domain before applying IFFT, making the time-domain signal behave more like a single-carrier signal rather than a multi-carrier one like OFDM. Deeper Explanation: Aspect OFDM DFTs-OFDM Signal Type Multi-carrier Single-carrier-like Process IFFT of QAM directly QAM → DFT → IFFT PAPR Level High (due to many carriers adding up constructively) Low (less fluctuation in amplitude) Why PAPR is High Subcarriers can add in phase, causing spikes DFT "pre-spreads" data, smoothing it Used in Wi-Fi, LTE downlink LTE uplink (as SC-FDMA) In OFDM, all subcarriers can...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

📘 Overview of BER and SNR 🧮 Online Simulator for BER calculation of m-ary QAM and m-ary PSK 🧮 MATLAB Code for BER calculation of M-ary QAM, M-ary PSK, QPSK, BPSK, ... 📚 Further Reading 📂 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 🧮 Online Simulator for Constellation Diagram of m-ary QAM 🧮 Online Simulator for Constellation Diagram of m-ary PSK 🧮 MATLAB Code for BER calculation of ASK, FSK, and PSK 🧮 MATLAB Code for BER calculation of Alamouti Scheme 🧮 Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received (after the demodulation process) compared to the total number of bits sent in a communication process. BER = (number of bits received in error) / (total number of tran...

BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc (MATLAB + Simulator)

📘 Overview 📚 QPSK vs BPSK and QAM: A Comparison of Modulation Schemes in Wireless Communication 📚 Real-World Example 🧮 MATLAB Code 📚 Further Reading   QPSK provides twice the data rate compared to BPSK. However, the bit error rate (BER) is approximately the same as BPSK at low SNR values when gray coding is used. On the other hand, QPSK exhibits similar spectral efficiency to 4-QAM and 16-QAM under low SNR conditions. In very noisy channels, QPSK can sometimes achieve better spectral efficiency than 4-QAM or 16-QAM. In practical wireless communication scenarios, QPSK is commonly used along with QAM techniques, especially where adaptive modulation is applied. Modulation Bits/Symbol Points in Constellation Usage Notes BPSK 1 2 Very robust, used in weak signals QPSK 2 4 Balanced speed & reliability 4-QAM ...

Theoretical vs. simulated BER vs. SNR for ASK, FSK, and PSK (MATLAB Code + Simulator)

📘 Overview 🧮 Simulator for calculating BER 🧮 MATLAB Codes for calculating theoretical BER 🧮 MATLAB Codes for calculating simulated BER 📚 Further Reading BER vs. SNR denotes how many bits in error are received for a given signal-to-noise ratio, typically measured in dB. Common noise types in wireless systems: 1. Additive White Gaussian Noise (AWGN) 2. Rayleigh Fading AWGN adds random noise; Rayleigh fading attenuates the signal variably. A good SNR helps reduce these effects. Simulator for calculating BER vs SNR for binary ASK, FSK, and PSK Calculate BER for Binary ASK Modulation Enter SNR (dB): Calculate BER Calculate BER for Binary FSK Modulation Enter SNR (dB): Calculate BER Calculate BER for Binary PSK Modulation Enter SNR (dB): Calculate BER BER vs. SNR Curves MATLAB Code for Theoretical BER % The code is written by SalimWireless.Com clc; clear; close all; % SNR va...