Basics of Congestion Control

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/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. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
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…