Total Length Field in IPv4

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/networking/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. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…