Basics of Congestion Control
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), 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, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): 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), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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
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: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.

