Congestion Detection Phase Phase-1

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/tl-congestion-udp/congestion-control-policy/asset-congestion-detection-phase-phase-1 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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 Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full 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

  1. 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. 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.

Loading lesson…