Fragmentation Field in IPv4

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/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-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…