Fragmentation Field in IPv4

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/net-layer-ipv4-proto/fragmentation-mtu/asset-fragmentation-field-in-ipv4 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment focuses on the Fragmentation Offset field within the IPv4 header, a critical component for reassembling fragmented datagrams at the destination. The instructor defines this field as a 13-bit value that indicates the relative position of a fragment's data within the original datagram. A key pedagogical point emphasized throughout is that this offset is not measured in individual bytes but rather in units of 8 bytes. To illustrate this mechanism, the instructor utilizes a concrete example involving a datagram with a total size of 4000 bytes, numbered sequentially from byte 0 to byte 3999. The lecture demonstrates how this large datagram is fragmented into three distinct parts, calculating the specific offset value for each fragment by dividing its starting byte number by 8. The visual aids include diagrams showing the byte ranges for each fragment and mathematical formulas explicitly demonstrating the division process. Additionally, a whiteboard note indicates the maximum datagram size of 65,536 bytes, providing context for the field's capacity.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the Fragmentation Offset field in the IPv4 header, defining it as a 13-bit value that specifies the relative position of a fragment within the original datagram. The core concept taught is that this offset is measured in units of 8 bytes, not single bytes. Evidence includes on-screen text stating "Fragmentation Offset: The 13-bit fragmentation offset field shows the relative position of this fragment with respect..." and "It is the offset of the data in the original datagram measured in units of 8 bytes." The instructor sets up a calculation example using a 4000-byte datagram where bytes are numbered from 0 to 3999. Visual diagrams display the byte ranges for three fragments, and mathematical formulas appear showing the initial calculation "Offset = 0000/8 = 0" for the first fragment.

  2. 2:00 – 5:00 02:00-05:00

    The lecture proceeds to calculate the offset values for the second and third fragments of the 4000-byte datagram. The instructor explains that the first fragment carries bytes 0 to 1399, resulting in an offset value of 0/8 = 0. For the second fragment, which carries bytes 1400 to 2799, the offset is calculated as 1400/8 = 175. The third fragment, carrying bytes 2800 to 3999, has an offset of 2800/8 = 350. On-screen text explicitly lists these calculations: "The second fragment carries bytes 1400 to 2799; the offset value => 1400/8 = 175" and "The third fragment carries bytes 2800 to 3999. The offset value => 2800/8 = 350." The instructor points to the IP header diagram and gestures towards the byte ranges to emphasize how the division by 8 determines the position.

  3. 5:00 – 8:17 05:00-08:17

    The final segment reinforces the calculation logic and introduces context regarding datagram size limits. The instructor reiterates that the Fragmentation Offset field is a 13-bit value indicating position in units of 8 bytes. The visual summary shows the complete breakdown: first fragment offset 0, second fragment offset 175, and third fragment offset 350. A significant visual cue appears on the whiteboard where a hand writes "65 536" near the header structure, likely indicating the maximum size of an IPv4 datagram. The text on screen confirms the byte numbering from 0 to 3999 and repeats the formulas "Offset = 1400/8 = 175" and "Offset = 2800/8 = 350." This section concludes the explanation of how offsets are derived for reassembly purposes.

The lecture provides a clear, step-by-step explanation of the Fragmentation Offset field in IPv4 headers. The central concept is that fragmentation allows large datagrams to be split into smaller units for transmission, and the offset field ensures they can be reassembled correctly. The instructor uses a consistent example of a 4000-byte datagram to demonstrate the calculation method. The critical rule is that the offset value represents the starting byte position divided by 8, reflecting the 8-byte granularity of the field. This is evidenced by the repeated formulas showing divisions like 1400/8 = 175. The inclusion of the number "65 536" on the whiteboard suggests a connection to the maximum datagram size, which is 2^16 bytes, though the specific relationship between this limit and the offset field's range is not explicitly detailed in the visible text. The teaching flow moves from definition to calculation, then to specific examples, ensuring students understand both the theoretical basis and practical application of the offset field.

Loading lesson…