Congestion Window

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-data-communication-network/tl-congestion-udp/congestion-control-policy/asset-congestion-window after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | DBMS: 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, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
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…