Congestion Detection Phase Phase-1
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | 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
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
- 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
- Paper-2 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment explains the Congestion Detection Phase in TCP, specifically how a sender reacts when loss is detected via timeout. The instructor presents a slide titled “Congestion Detection Phase” and introduces the sub-heading “Detection On Time Out,” defining it as the situation where the “Time Out Timer expires before receiving the acknowledgement for a segment.” The reaction steps are listed: setting the slow start threshold to half of the current congestion window size, decreasing the congestion window size to 1 MSS, and resuming the slow start phase. A graph of Congestion Window (cwnd) versus Round Trip Transmission (RTT) is used to illustrate the slow start and congestion avoidance phases, with annotations for “Slow start,” “Congestion Avoidance,” “Threshold (ssthresh),” and the “Congestion point of network.” The graph shows exponential growth during slow start, linear growth during congestion avoidance, and a drop in cwnd at the congestion point. The instructor points to these phases and the threshold line, emphasizing how timeout recovery resets the window and restarts slow start. The content is grounded in visible slide text and graph labels; no audio transcript is available, so explanations are inferred from on-screen cues.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with the slide “Congestion Detection Phase” and introduces “Detection On Time Out,” defined by the red-underlined line: “Time Out Timer expires before receiving the acknowledgement for a segment.” The reaction steps are listed, including “Setting the slow start threshold to half of the current congestion window size,” “Decreasing the congestion window size to 1 MSS,” and “Resuming the slow start phase.” A graph of Congestion Window (cwnd) versus Round Trip Transmission (RTT) is displayed, showing the “Slow start” and “Congestion Avoidance” phases. The graph illustrates exponential growth during slow start, linear growth during congestion avoidance, and a drop in cwnd at the “Congestion point of network.” The instructor points to the “Threshold (ssthresh)” line and highlights the congestion point at the peak of the graph.
2:00 – 4:06 02:00-04:06
The lecture continues with the same “Congestion Detection Phase” slide, reinforcing that the sender reacts differently depending on how loss is detected. The “Detection On Time Out” sub-heading and its definition are revisited, with the reaction steps circled using a red hand-drawn bracket. The text slide details the specific actions taken upon detecting loss via timeout, such as resetting thresholds and window sizes. The instructor underlines key terms like “before” and “strong possibility of congestion,” emphasizing the significance of timeout as a signal for network congestion. The graph remains visible, illustrating the cwnd dynamics and the transition from slow start to congestion avoidance, with the threshold line clearly marked.
The core teaching point is that TCP congestion detection via timeout triggers a specific recovery sequence: halving the slow start threshold, resetting the congestion window to 1 MSS, and resuming slow start. This is visually reinforced by a cwnd vs RTT graph that distinguishes exponential growth (slow start) from linear growth (congestion avoidance) and shows the cwnd drop at congestion. The instructor uses annotations, underlining, and hand-drawn brackets to highlight key terms and steps, ensuring students connect the textual reaction rules with the graphical behavior. The lesson emphasizes that timeout is a strong indicator of congestion, prompting conservative window reduction to prevent further network overload.

