Basics of Fragmentation

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/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. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length 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…