Total Length Field in IPv4

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-computer-networks/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. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: 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
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…