TCP Header-Window Size Field

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/transport-layer-services/tcp-header-fields/asset-tcp-header-window-size-field after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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, Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces TCP flow control via the Window Size field, emphasizing that a sender must never transmit data exceeding what the receiver can accept. The 16-bit field defines the number of bytes reserved by the receiver, capping the window at 2^16 = 65,535 bytes. The instructor maps this to a sender-receiver diagram (RC/RS) and notes that the receiver determines the window size. Later, the slide explains that 14 additional bits can be taken from options to extend the window size to 30 bits, allowing up to approximately 1GB of advertised data.

Chapters

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

    The slide titled "Window Size/Advertisement window(Flow control)" presents the core principle: "Basics idea is a sender should never send what a receiver can not receive." A TCP header table lists "Window size 16 bits" alongside "Sequence number 32 bits" and a blue bar for "Options and padding (up to 40 bytes)." A segment diagram shows a Header box and Data bar marked "20 to 60 bytes." The instructor begins explaining that the window size field defines the receiver's reserved buffer space.

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

    The instructor draws a whiteboard diagram with labels "RC" (receiver) and "RS" (sender) to illustrate flow control. Handwritten annotations show the calculation "2^16 = 65,535" and a box labeled "16KB," linking the 16-bit field length to its maximum byte capacity. The instructor points directly at the "Window size 16 bits" field in the TCP header table, emphasizing that this value is determined by the receiver and dictates how much data the sender may transmit. The slide text reiterates: "Note that the length of this field is 16 bits, which means that the maximum size of the window is 65,535 bytes."

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

    The lecture transitions to extending the window size. The slide states that the 16-bit field advertises very little data, but "additional 14 bits can be taken from options so total size become 30 bits or 1GB." Red pen marks circle "14 bits can be taken" and underline the second bullet. Handwritten notes on the right show "2^" next to a circled "1GB," with a crossed-out boxed "64." The segment diagram and TCP header table remain visible, reinforcing that the options field (up to 40 bytes) provides space for these extra bits.

The lecture progresses from defining the TCP Window Size field to calculating its maximum capacity and finally extending it via options. Key concepts include: (1) Flow control principle—sender must not exceed receiver capacity; (2) The 16-bit window size field limits the advertised window to 65,535 bytes (2^16); (3) The receiver determines the window size; and (4) 14 additional bits from options extend the field to 30 bits, enabling up to ~1GB of advertised data. The worked example involves computing 2^16 = 65,535 and recognizing the limitation of 16 bits for modern high-bandwidth links. The transition from basic definition to extension via options highlights a practical TCP design consideration.

Loading lesson…