Total Length Field in IPv4

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/net-layer-ipv4-proto/net-layer-ipv4-basics/asset-total-length-field-in-ipv4 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, अनुक्रम, श्रेणी और संयोजन / Sequences, Series and Combinatorics, समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, Statistics, Probability, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समय और कार्य / Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Paper-1 & 2 | Data Interpretation: आँकड़ा निर्वचन / Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Data Arrangement, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making
  7. Paper-1 | General Science: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, समसामयिकी / Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर नेटवर्क / Computer Networks
  22. Paper 2 | Pedagogy: वृद्धि और विकास / Growth and Development, विकास के सिद्धांत / Theories of Development, Concept of Pedagogy, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture explains the IPv4 Total Length field and its relationship to Maximum Transfer Unit (MTU) constraints. The instructor defines Total Length as the combined size of the IP header and data payload in bytes, noting it is a 16-bit field. The minimum datagram length is 20 bytes (header only, no data), while the maximum is 65,535 bytes, derived from the formula 2^16 - 1. The instructor writes and emphasizes the key formula: Length of data = Total length - (HLEN × 4), where HLEN is the header length in 32-bit words. The lecture then transitions to MTU, explaining that each link-layer protocol has a maximum payload size for encapsulated datagrams. A comparison table lists MTU values: Hyperchannel (65,535), Token Ring 16 Mbps (17,914), FDDI (4,352), Ethernet (1,500), and PPP (296). A diagram shows an IP datagram encapsulated within a frame payload, illustrating that the total datagram size must not exceed the link's MTU. This establishes why IP fragmentation may be necessary when a datagram exceeds the next-hop link's MTU.

Chapters

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

    The instructor introduces the Total Length field, stating on slide that it 'defines the total length (header plus data) of the IP datagram in bytes.' Two key bullets appear: 'Minimum total length of datagram = 20 bytes (20 bytes header + 0 bytes data)' and 'Maximum total length of datagram = Maximum value of 16-bit word = 65535 bytes.' An IPv4 header table is displayed on the right, listing fields including VER (4 bits), HLEN (4 bits), Service type (8 bits), Total length (16 bits), Identification (16 bits), Flags (3 bits), Fragmentation offset (13 bits), Time-to-live (8 bits), Protocol (8 bits), Header checksum (16 bits), Source/Destination IP address (32 bits each), and Options + padding (0 to 40 bytes). The instructor gestures toward the Total length cell while explaining its significance.

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

    The instructor writes the formula 'Length of data = total length - (HLEN) × 4' on the board, circling the HLEN term to emphasize that header length is measured in 32-bit words. Handwritten working shows '16 → = 2^16 − 1 =' with the result '65535' written to demonstrate the maximum value calculation. The lecture then transitions to Maximum Transfer Unit (MTU). A new slide states 'Each link-layer protocol has its own frame format' and that one feature is 'the maximum size of the payload that can be encapsulated.' A table compares MTU values: Hyperchannel 65,535; Token Ring (16 Mbps) 17,914; FDDI 4,352; Ethernet 1,500; and PPP 296. A diagram on the right shows an IP datagram (Header + Payload) inside a frame, labeled 'MTU: Maximum size of frame payload.' The instructor points to the Ethernet and FDDI rows, highlighting that when a datagram is encapsulated in a frame, its total size must be less than the MTU.

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

    The final sampled frame returns to the Total Length slide, showing the text 'It defines the total length (header plus data) of the IP datagram in bytes.' This appears to be a recap or transition point, reinforcing the core definition before potentially moving to fragmentation. The MTU table and encapsulation diagram remain visible in earlier frames of this window, confirming the connection between Total Length constraints and link-layer MTU limits.

The lecture builds a logical progression from field definition to practical constraint. First, Total Length is defined as a 16-bit field measuring header plus data in bytes, with bounds of 20 to 65,535. The formula Length of data = Total length - (HLEN × 4) provides the method to compute payload size from header parameters. The MTU section then introduces a critical real-world constraint: while IP allows datagrams up to 65,535 bytes, individual links (especially Ethernet at 1,500 bytes) impose much smaller maximum payload sizes. The encapsulation diagram visually connects these concepts, showing that an IP datagram must fit within a frame's payload limit. This sets up the necessity of fragmentation when a datagram exceeds the next-hop MTU, though fragmentation itself is not explicitly covered in the sampled windows. Key exam points: remember HLEN is in 32-bit words (multiply by 4 for bytes), minimum datagram is 20 bytes, and Ethernet's 1,500-byte MTU is the most commonly tested value.

Loading lesson…