Congestion Window

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/computer-networks/tl-congestion-udp/congestion-control-policy/asset-congestion-window after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces TCP flow control and congestion control by explaining the two windows used in each direction of data transfer: the send window and the receive window. The instructor, wearing a black "KG KNOWLEDGE" polo shirt, presents slides titled "Windows in TCP" and "Congestion Window." The core teaching point is that the sender window size is determined by two factors: the receiver window size and the congestion window size. A hand-drawn diagram with nodes labeled S, N, and R is annotated step by step to illustrate the data flow between sender, network, and receiver. The instructor emphasizes that a sender must not send data greater than the congestion window size to avoid dropping TCP segments and causing retransmissions. The key formula presented is: Sender window size = Minimum (Receiver window size, Congestion window size). The congestion window is known only to the sender and is not sent over the links, with different TCP variants using different approaches to calculate its size.

Chapters

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

    The slide headed "Windows in TCP" states that "TCP uses two windows (send window and receive window) for each direction of data transfer." Under the "Send Window" heading, the slide lists "Receiver window size and Congestion window size," both underlined in red. A hand-drawn diagram below uses red circles labeled N and R, green and blue arrows, and handwritten labels such as "3.5KB," "16 KB," and "14B." At 45s, the slide briefly shows a "Receive Window" section with red underlines and a small red arrow on lines about not exceeding the receiver window size. From 55s, the slide returns to "Windows in TCP," and the diagram gains S, R, and N nodes joined by arrows, where the R boxes are circled and crossed out in red. The instructor shifts his gaze between the camera and the slide while annotating the diagram step by step.

  2. 2:00 – 3:24 02:00-03:24

    The focus shifts to the "Congestion Window" slide. The instructor explains that a sender should not send data greater than the congestion window size, otherwise it leads to dropping TCP segments which causes TCP retransmission. The text on screen states: "So, sender should always send data less than or equal to congestion window size." It also notes that different variants of TCP use different approaches to calculate the size of the congestion window, and that the congestion window is known only to the sender and is not sent over the links. A formula is shown with a red arrow pointing to the word "Minimum": "In general, Sender window size = Minimum (Receiver window size, Congestion window size)." Red underlines emphasize key terms like "congestion window size," "TCP segments," and "TCP Retransmission."

The lecture builds a clear progression from the general concept of TCP windows to the specific rule governing sender behavior. First, it establishes that TCP uses two windows per direction: send and receive. Then it identifies the two determinants of the sender window size: receiver window size (flow control) and congestion window size (congestion control). The hand-drawn diagram with S, N, and R nodes visually anchors the sender-network-receiver relationship. The critical takeaway is the formula: Sender window size = Minimum (Receiver window size, Congestion window size). The instructor stresses that exceeding the congestion window causes segment drops and retransmissions, so senders must always stay at or below that limit. The congestion window is sender-local and not transmitted over the network, with calculation methods varying by TCP variant. This distinction between flow control (receiver-driven) and congestion control (sender-driven, network-aware) is the central pedagogical goal.

Loading lesson…