Congestion Window

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-computer-networks/tl-congestion-udp/congestion-control-policy/asset-congestion-window after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: 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, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: 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, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…