Congestion Detection Phase Phase-2

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/tl-congestion-udp/congestion-control-policy/asset-congestion-detection-phase-phase-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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

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

Loading lesson…