Example of Fragmentation

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: 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, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: 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, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…