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?




📊 MATLAB & ONLINE SIMULATIONS (Web-Based)
🎓 GATE & UGC - NET SOLUTIONS
📡 WIRELESS & SIGNAL PROCESSING


Contact Us

Name

Email *

Message *

Popular Posts

CMOS Logic Gates: Inverter, NAND, and NOR

CMOS Logic Gates: Inverter, NAND, and NOR Complementary metal–oxide–semiconductor (CMOS) technology forms the backbone of modern digital IC design. Patented by Frank Wanlass in 1963 ( US patent 3,356,858 ), CMOS enables low-power, high-speed, and noise-immune logic circuits. CMOS gates, including inverters, NAND, and NOR, are widely used in both large-scale and small-scale integrated circuits due to their efficiency and versatility. CMOS Inverter A CMOS inverter consists of a complementary pair of PMOS and NMOS transistors. The PMOS transistor connects to the supply voltage V DD , while the NMOS connects to ground. The input voltage V IN controls both gates, and the output voltage V OUT is taken from the connected drains. CMOS inverters are highly energy-efficient and produce minimal heat due to their comple...
Read more

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2026 - Question Paper Download PDF June 202...
Read more

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...
Read more

Decision Feedback Equalizer (DFE) in MATLAB

  MATLAB Code M = 4; % QPSK numSymbols = 10000; numTrainingSymbols = 5000; chtaps = [1 0.5*exp(1i*pi/6) 0.1*exp(-1i*pi/8)]; % Generate QPSK symbols data = randi([0 M-1], numSymbols, 1); tx = pskmod(data, M, pi/4); % DFE setup eq = comm.DecisionFeedbackEqualizer; eq.ReferenceTap = 1; eq.NumForwardTaps = 5; eq.NumFeedbackTaps = 3; % SNR sweep snrVec = 0:5:25; % 0,5,10,...25 dB berBefore = zeros(size(snrVec)); berAfter = zeros(size(snrVec)); for k = 1:length(snrVec) % Apply channel and AWGN rx = awgn(filter(chtaps,1,tx), snrVec(k), 'measured' ); % BER before equalization rxDataNoEq = pskdemod(rx, M, pi/4); [~, berBefore(k)] = biterr(data, rxDataNoEq); % Equalize [y,~,~] = eq(rx, tx(1:numTrainingSymbols)); % Phase correction phaseOffset = angle(mean(conj(tx(1:numTrainingSymbols)) .* y(1:numTrainingSymbols))); yCorrected = y * exp(-1i*phaseOffset); % BER after equalization rxDataEq = pskdemod(yCorrected, M, pi/4); [...
Read more

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...
Read more

Superheterodyne Receiver Online Simulator

Superheterodyne Receiver Simulator Simulation Controls Message Frequency (Hz): Carrier Frequency (Hz): Intermediate Frequency (Hz): Sampling Frequency (Hz): Simulation Duration (s): Run Simulation Signal Plots Numerical Values (first 10 samples) Superheterodyne Receiver Workflow The superheterodyne receiver converts a received RF signal to an intermediate frequency (IF) to simplify filtering and amplification, and finally recovers the original message signal. Steps: Input Message Signal: A low-frequency signal m(t) (e.g., sine wave). RF Modulation (AM): The message modulates the carrier with amplitude modulation: RF(t) = [1 + K_a * m(t)] * cos(2Ï€ f_c t) Mixing with Local Oscillator (LO): The RF signal is multiplied by a local oscillator LO(t) = cos(2Ï€ f_LO t) to produce: IF(t) = RF(t) * LO(t) Intermediate Frequency Filtering: A low-pass filter extracts t...
Read more

MUSIC Algorithm Explained (with MATLAB + Simulator)

Practical Implementation of the MUSIC Algorithm The focus is on how the algorithm works computationally , not just theory, and it explains the denominator (a H E n E n H a) mathematically and intuitively. 1. Introduction The MUSIC (Multiple Signal Classification) algorithm is a high-resolution method used in signal processing and array processing to estimate the Direction of Arrival (DOA) of signals received by a sensor array. Unlike classical beamforming methods, MUSIC uses eigenvector decomposition of the covariance matrix to separate the signal subspace and noise subspace , allowing it to achieve much higher angular resolution. In practical implementations, MUSIC works by: Simulating or collecting array signals Computing the covariance matrix Performing eigenvalue decomposition Separating signal and noise subspaces Scanning possible angles using a steering vector Constructing a pseudo-spectrum where peaks indicate signal directions 2. Signal Mo...
Read more

Linear vs Circular Convolution

Linear vs Circular Convolution Linear convolution vs circular convolution Linear convolution (what nature does) If: x[n] = transmitted signal h[n] = channel impulse response (multipath) Then the received signal is: y[n] = x[n] * h[n] This means: Past symbols spill into future symbols Causes inter-symbol interference (ISI) DFT of y[n] is not a simple product Circular convolution (what DFT assumes) The DFT assumes periodic signals : y[n] = x[n] ⊛ h[n], where indices wrap around modulo N Only under circular convolution does the DFT satisfy: Y[k] = X[k] · H[k] This is what enables one-tap frequency-domain equalization . What happens in the real channel (linear convolution) The channel performs linear convolution: y[n] = Σ l=0 Lh−1 h[l] x[n-l] But because: CP absorbs the “spillover” Receiver discards CP before DFT The useful part of the received symbol becomes: y[n] = Σ l=0 Lh−1 h[l] x[(n-l) mod N] Modulo inde...
Read more