Fragmentation Field in IPv4

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/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. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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 Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. 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…