Basics of Congestion Control

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/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. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: 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
  9. Paper 2 | 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
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. Paper 2 | 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
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/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 Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
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…