Basics of Windows in TCP

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/tl-congestion-udp/congestion-control-policy/asset-basics-of-windows-in-tcp 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 windowing, emphasizing that each direction of data transfer uses a send and receive window, resulting in four windows for bidirectional communication. The instructor explains that the sender's window size is governed by two factors: receiver window size and congestion window size. A hand-drawn diagram illustrates sender S and receiver R with directional arrows, annotated with example buffer sizes such as 3–4 KB and 16 KB. The final segment reinforces the congestion window concept, with red markings crossing out receiver boxes to highlight sender-side constraints.

Chapters

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

    The slide titled 'Windows in TCP' states that TCP uses two windows (send and receive) per direction, i.e., four for bidirectional communication. Under 'Send Window,' the sender window size is determined by receiver window size and congestion window size. Red handwritten letters C, S, and a circled D appear, followed by green S and R annotations.

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

    The instructor, visible in a black polo shirt, elaborates on the slide content. A hand-drawn diagram shows C above S with a green arrow to R, and below a circled 2 row with R and a blue arrow from S. The presenter writes '3-4KB' and '16 KB' under the boxes, adding a curved arrow labeled rR pointing to the top send box.

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

    The slide reiterates that TCP uses send and receive windows per direction. The 'Send Window' section underlines 'Congestion window size.' A hand-drawn diagram shows sender S (3–4 KB box) and receiver R boxes, with a green arrow top and blue arrow bottom; the R boxes are crossed out in red.

The lecture systematically builds understanding of TCP windowing by first defining the four-window structure for bidirectional communication. It then focuses on the send window, identifying receiver and congestion windows as determining factors. Visual annotations, including directional arrows and buffer size examples (3–4 KB, 16 KB), clarify the interaction between sender and receiver. The final red markings on receiver boxes emphasize that congestion window constraints primarily affect the sender's transmission capacity.

Loading lesson…