Example of Fragmentation

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/computer-networks/net-layer-ipv4-proto/fragmentation-mtu/asset-example-of-fragmentation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment explains IP fragmentation using a concrete example involving two hosts with different Maximum Transmission Unit (MTU) constraints. Host A resides in Network X with an MTU of 520 bytes, while Host B is in Network Y with a smaller MTU of 200 bytes. The instructor visualizes the problem by drawing network boundaries and packet structures, demonstrating how a 520-byte packet from Host A must be fragmented to traverse Network Y. The core concept involves splitting the payload into chunks that fit the smaller MTU, accounting for a 20-byte IP header. The lecture details the calculation of fragment offsets and lengths, showing how a 500-byte payload is divided into fragments with specific data sizes (e.g., 176 bytes) and offsets derived by dividing the byte count by 8. The visual progression moves from defining the scenario to drawing diagrams, performing handwritten calculations for offsets (e.g., 176 / 8 = 22), and illustrating the final fragmented packets sent to Host B.

Chapters

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

    The instructor introduces the networking problem involving Host A in Network X (MTU = 520 bytes) and Host B in Network Y. He draws a network boundary for Host A and illustrates data segmentation within the MTU limit, explicitly writing "Example: Consider host A is present in network X having MTU = 520 bytes." The visual setup includes the labels "X", "A", and the number "520" on screen, establishing the initial scenario where a large packet must be sent to a host with smaller network constraints.

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

    The lecture focuses on the mechanics of IP fragmentation as a 520-byte packet is split to fit Network Y's MTU of 200 bytes. The instructor draws diagrams showing a 20-byte header plus data, calculating that the payload is divided into chunks like 176 bytes. Visible handwritten calculations include "= 176 / 8 = 22" to determine fragment offsets, and numbers like "352" and "148" representing data lengths. The whiteboard displays the progression from an initial 500-byte payload to three fragmented packets, with the instructor pointing to specific calculations to explain how data is distributed across fragments.

  3. 5:00 – 5:07 05:00-05:07

    The segment concludes with the instructor summarizing the fragmentation process. The whiteboard shows the final state of three fragmented packets, with calculations for offsets and lengths visible. The instructor points to these fragmented packet calculations to illustrate how the original 500-byte payload is distributed. The screen displays labels "M=1" and the network identifiers "X", "Y", "A", "B", confirming the completion of the example where Host A's data is successfully segmented for Host B.

The video provides a step-by-step walkthrough of IP fragmentation, emphasizing the relationship between MTU sizes and packet segmentation. The instructor uses a specific numerical example (520 bytes vs 200 bytes) to make the abstract concept concrete. Key technical details include the 20-byte IP header overhead, the division of payload data into fragments that fit the smaller MTU, and the critical calculation of fragment offsets by dividing byte counts by 8. The visual evidence on the whiteboard, including numbers like "176", "352", and "22", supports the explanation of how data is split and reassembled. This example serves as a practical demonstration of network layer handling when packets exceed the MTU of an intermediate link.

Loading lesson…