Basics of Fragmentation

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layer-ipv4-proto/fragmentation-mtu/asset-basics-of-fragmentation 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 introduces IP datagram fragmentation, a critical mechanism in computer networking that allows large packets to traverse networks with smaller Maximum Transmission Units (MTUs). The instructor establishes the fundamental rule that while fragmentation can occur at any point in the path—either by the source host or intermediate routers—the reassembly of these fragments is exclusively performed by the destination host. This distinction ensures that each fragment travels as an independent datagram, potentially taking different routes through the network. The session progresses from conceptual definitions to visual demonstrations of fragmentation at routers, followed by a technical breakdown of the IP header fields required to manage this process.

Chapters

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

    The lecture begins with a definition of fragmentation as the process of dividing a datagram into smaller fragments during transmission. The instructor emphasizes that reassembly occurs only at the destination host because each fragment becomes an independent datagram. A diagram is drawn showing a source (S) and destination (D), illustrating that fragmented datagrams can travel through different routes. On-screen text confirms the rule: 'The reassembly of the datagram, is done only by the destination host.' The instructor visually demonstrates a large datagram labeled 'R0 540B' at the source, setting up the context for how size constraints necessitate splitting data.

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

    The instructor illustrates the fragmentation process at an intermediate router, specifically Router N1. A large datagram of size 3540B originating from source S is shown being split to fit the MTU of the next hop. The visual progression shows arrows indicating how these fragments are routed towards destination D. The instructor points to the routers and writes '200B' below N1, indicating a link capacity constraint. The slide reinforces that the fragmented datagram can travel through different routes. This section visually demonstrates how a 3540B packet is divided into smaller fragments, such as 1800B and a remainder, to accommodate network limitations.

  3. 5:00 – 6:05 05:00-06:05

    The focus shifts to the technical implementation of fragmentation using IP header fields. The instructor explains the 'Flag Field', a 3-bit field defining three flags: reserved, Don't Fragment (DF), and More Fragments (MF). The slide text specifies that if the DF bit is set to 1, 'the machine must not fragment the datagram.' The MF bit indicates if more fragments follow (1) or if it is the last fragment (0). The instructor draws arrows to show a 200B datagram being fragmented into smaller units like 180B and 20B as it traverses a network with an MTU of 100B, eventually reaching destination D. This section connects the conceptual diagram to specific header control bits.

The lecture effectively bridges the gap between high-level network concepts and low-level packet implementation. The progression moves from defining fragmentation as a necessity for traversing heterogeneous networks to demonstrating the physical splitting of datagrams at routers. The instructor uses visual aids, such as drawing arrows and labeling sizes like '3540B' or '200B', to make abstract constraints concrete. A critical takeaway is the separation of concerns: routers handle fragmentation for efficiency, while destination hosts handle reassembly to ensure data integrity. The final segment on the IP header flags provides the mechanism for controlling this behavior, specifically highlighting how the DF and MF bits dictate whether fragmentation is allowed and how fragments are ordered. This structure ensures students understand both the 'why' (MTU constraints) and the 'how' (header flags) of IP fragmentation.

Loading lesson…