Congestion Detection Phase Phase-2
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
- Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
- Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
- Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
- Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
- Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
- Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
- Section B | Networking: 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
- Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
- Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
- Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- MOCK TEST:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment covers Phase 2 of TCP congestion detection, focusing on the sender's reaction to receiving three duplicate acknowledgements. The instructor explains that this event indicates a weaker possibility of network congestion compared to a timeout, suggesting that a segment may have been dropped while later segments reached the receiver. The sender's reaction involves setting the slow start threshold to half of the current congestion window size, decreasing the congestion window to this new threshold, and resuming the congestion avoidance phase. The second half of the video uses a graph to illustrate TCP congestion window behavior over time, with red annotations highlighting fast retransmission points and ssthresh levels across multiple cycles of slow start, congestion avoidance, and fast recovery.
Chapters
0:00 – 2:00 00:00-02:00
The instructor presents a slide titled 'Detection On Receiving 3 Duplicate Acknowledgements,' explaining that this event suggests a weaker possibility of congestion in the network. The slide lists the sender's reaction: setting the slow start threshold to half of the current congestion window size, decreasing the congestion window to this new threshold, and resuming the congestion avoidance phase. The instructor begins drawing a red diagram on the right side of the slide to illustrate packet loss and retransmission, with underlined keywords like '3 Duplicate Acknowledgements' emphasizing the key concept.
2:00 – 4:01 02:00-04:01
The video transitions to a graph showing TCP congestion window size over time, with the instructor using red annotations to highlight specific events. A red circle marks the 'fast retransmission' point, while horizontal red lines trace ssthresh levels across different time intervals. The graph displays multiple cycles of slow start, congestion avoidance, and fast recovery phases, with the instructor pointing to timeout events and explaining how window size increases during slow start and congestion avoidance before dropping upon packet loss.
The lecture progresses from conceptual explanation to graphical illustration of TCP congestion control. The first phase establishes the theoretical framework: three duplicate acknowledgements trigger a specific reaction involving threshold adjustment and window reduction. The second phase visualizes this behavior through a time-series graph, connecting the abstract rules to concrete window size changes. Key pedagogical elements include structured bullet points for reaction steps, hand-drawn diagrams for packet flow, and annotated graphs showing phase transitions. The central idea is that duplicate acknowledgements represent a milder congestion signal than timeouts, warranting less aggressive window reduction (halving ssthresh rather than resetting to 1 MSS).

