Continue to Site

Welcome to our site!

Electro Tech is an online community (with over 170,000 members) who enjoy talking about and building electronic circuits, projects and gadgets. To participate you need to register. Registration is free. Click here to register now.

  • Welcome to our site! Electro Tech is an online community (with over 170,000 members) who enjoy talking about and building electronic circuits, projects and gadgets. To participate you need to register. Registration is free. Click here to register now.

How can a 13 bit number represent 16 bit number?Or why is fragmentation offset multiple of 8?

Status
Not open for further replies.

watchdog545

New Member
This is more of a mathematics confusion so hope to get resolved here.




I am studying about ipv4 fragmentation.
This is ipv4 header. The fields of concern here are-:
-> identification(16 bit)

-> Flags(3 bit)

-> fragment offset(13 bit)

-> Total length(16 bit)
osLP14KozhJNK_yYeFYobGKuQwarImaLZJQ4SQEzekBBKamtp3ocZlHGYhzNNHfdoVrsC-Uut7AKvj4IzNb-xlLizuucy4UZFQxuPJmnZE2iVIY5JeIwkQbF8uwXfDSjBGkUZuXybT7JUNjI1g


In order to understand these concepts of fragmentation, I have solved multiple problems. One of them is below.
aAlrRlma7ffW_-kF5BJBsdxEzOKvPnBL0V4Zp4tfPzZi9oBf0sqmqAKuuvPCc2ChzB9tjz3GeVb9pXf-485tpVEIanZfEehd3OjCevm8XlHTwBvwjdHRk29R9YZLLrSrW22GHkRL4we0T2Fa4w

Here initially we have 5000 byte datagram of which 20 byte is header.
The MTU is 1500 bytes.

The answer is this-:
Jh7--OSXMOOczTfUzdwKy2qNCGtJ8m2uS01Me59l_GQwbMNE1AUAsPFswQqg8JWm0-fpPUwyvQCc3Zu-UmJH8G6NCgh3p2m4vPtV-AY3uvGDHTKGSsX08FbBuE-Hl11vbLBYlWX1YYmTf45-_g

But I am unable to realize this simple concept that I believe even a 5th grader can understand even though I am college level undergraduate student. It is being pretty shameful for me.I am leaving my shame aside and asking this instead of giving up. I have asked this everywhere and everyone says this is basic math but it is not clicking in my head. Imma memorize this lol. I can solve any numerical problem related to fragmentation but this curiosity isn’t letting me to learn further and go to ipv6.
It would be immensely helpful to me if anyone can help me via that above example to understand this simple concept. I am unable to relate with this concept.
I agree there are 2^13 offset values ie 0,1,2,3,4,5,6,7,8,9…..8191. So that is the total no. of fragments possible 8192 fragments. But datagram can be only as big as 2^16-1 bytes. But why are we dividing them? It doesn’t make any sense. Maybe it is trying to say that 8192 fragments need to span 65535 bytes which gives 7.99987793 as the answer. But I have calculated it later, and fragmentation doesn’t work like that.

Opinion 1-:

Max “true” fragment offset possible=sum of all previous DATA ONLY excluding header
=65535-n*20 bytes.

Where 65535 is the max total length possible.n is the number of fragments and 20 bytes is the header length
The max value of offset possible is 8191. 65535-n*20 bytes should be represented by 8191 (both max values). But this opinion takes nowhere.


Opinion 2-:
Max. 13 bit number=8191
Max 16 bit number=65535
So 65535/8191=8.0000sthsth (not exactly 8).

So the problem is like how can max offset value represent the max data size. But as i said in opinion 1, max data size can never be 65535 as header also takes up some space.

Opinion 3–:
Say i want to understand this example by a dummy example. Say fragmentation offset field is of 1 bit. And total length field is of 4 bit. What would happen?

Here are some answers that I have read which gave me further confusions-:
https://networkengineering.stackexc...26/why-ip-fragmentation-is-on-8-byte-boundary

https://learningnetwork.cisco.com/s/question/0D53i00000Kt7dxCAB/fragment-offset-concept
 
Didn't understand most of that but 2^16/2^13 = 8 because there is 3 different in the powers and 2^3=8. I would also guess that 65536 (2^16)/8192(2^13) will also produce 8.

You're using (2^n)-1 instead of 2^n.

Mike.
Edit, typo.
 
You multiply the fragment offset by 8.

In the diagram, the first fragment used data offsets 0-1479 inclusive; 1480 bytes.

The offset in the second fragment is 185; multiply that by 8 and you get 1480, the next location after the end byte (1479) of the previous fragment.

To paraphrase Pommie's answer, you need to consider the range of offsets or addresses - including zero - not only the maximum value.

(Why a factor of eight? Because that fitted with having 13 bits available in the header. If 12 bits had been available, the size would have had to be in blocks of 16 bytes).
 
You multiply the fragment offset by 8.

In the diagram, the first fragment used data offsets 0-1479 inclusive; 1480 bytes.

The offset in the second fragment is 185; multiply that by 8 and you get 1480, the next location after the end byte (1479) of the previous fragment.

To paraphrase Pommie's answer, you need to consider the range of offsets or addresses - including zero - not only the maximum value.

(Why a factor of eight? Because that fitted with having 13 bits available in the header. If 12 bits had been available, the size would have had to be in blocks of 16 bytes).
thank you
 
Status
Not open for further replies.

Latest threads

New Articles From Microcontroller Tips

Back
Top