Basics of Congestion Control

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/computer-networks/tl-congestion-udp/congestion-control-policy/asset-basics-of-congestion-control after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. 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, Network Security, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This short lecture introduces the fundamentals of congestion control in computer networks. The instructor presents a slide titled “Congestion Control” and defines congestion as the network state in which message traffic becomes so heavy that it slows down network response time. Congestion control is then described as the set of techniques and mechanisms that either prevent congestion before it happens or remove congestion after it has happened. The slide also notes two TCP-related points: TCP reacts to congestion by reducing the sender window size, and TCP uses a combination of GBN (Go-Back-N) and SR (Selective Repeat) protocols to provide reliability. To make the idea concrete, the instructor draws a simple sender–receiver diagram with nodes labeled S and C (or client), adding arrows to show data flow from one end to the other and acknowledgments returning. Red underlining is used on key terms such as “Congestion,” “message traffic,” and “prevent congestion” to emphasize the core vocabulary. Because only sampled screenshots are available, no audio or full transcript is present; therefore the explanation relies on visible slide text and board annotations. The lesson remains at a conceptual level, establishing what congestion is, how control strategies are categorized (preventive vs. reactive), and how TCP’s window-size reduction serves as a basic congestion response.

Chapters

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

    The opening segment shows a static slide titled “Congestion Control” with an underlined heading. The first bullet defines congestion: “Congestion refers to a network state where, the message traffic becomes so heavy that it slows down the network response time.” The second bullet states that congestion control techniques “Either prevent congestion before it happens or remove congestion after it has happened.” Additional on-screen text notes that “TCP reacts to Congestion by reducing the sender window size” and that “TCP uses a combination of GBN and SR protocols to provide reliability.” Around the 45–85 second mark, a hand-drawn diagram appears with nodes labeled S and C (client), and arrows are added to illustrate data flow from one endpoint to the other and back, visually grounding the sender–receiver communication model.

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

    In the second half, the instructor continues explaining the same slide content while pointing to key terms. The visible text remains centered on the definitions of congestion and congestion control, with red underlining emphasizing “Congestion,” “message traffic,” and “prevent congestion.” The hand-drawn sender–receiver diagram persists, now with a wavy line representing data transmission between S and C. The instructor’s annotations reinforce the idea that congestion control is about managing traffic so response time does not degrade, and that TCP’s mechanism of reducing the sender window size is a direct reaction to congestion. No new formulas or worked examples are visible; the segment stays at the conceptual level, consolidating the preventive and reactive categories of congestion control techniques.

The lesson builds a foundational understanding of congestion control by first defining the problem (heavy traffic slowing response time) and then framing the solution space (prevent or remove congestion). The TCP-specific notes connect this general definition to a concrete protocol behavior: reducing the sender window size when congestion is detected, and using GBN/SR for reliability. The hand-drawn S–C diagram with bidirectional arrows serves as the primary visual aid, helping students map abstract definitions onto a simple communication model. Key takeaways for revision: (1) congestion = traffic overload degrading response time; (2) control techniques are either preventive or reactive; (3) TCP’s window-size reduction is its basic congestion response. Because evidence comes only from sampled screenshots without audio, the exact pacing and any verbal examples are not captured; however, the on-screen text and board annotations provide a clear, consistent conceptual framework suitable for exam preparation.

Loading lesson…