TCP Retransmission
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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)
- 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
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- 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
- SQL (Technical): SQL
- 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
- 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
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture explains TCP retransmission, focusing on how a sender recovers from lost segments. The instructor first introduces the two mechanisms that trigger retransmission: timeout timer expiry and receipt of three duplicate acknowledgements. The first part details the timeout process, where a sender starts a timer for each segment; if an ACK is not received before the timer expires, the same segment is retransmitted. The second part introduces fast retransmission using a worked example of five segments where segment 2 is lost. The receiver sends an original ACK for segment 1, then duplicate ACKs upon receiving segments 3, 4, and 5. After the sender receives three duplicate ACKs requesting segment 2, it retransmits segment 2 immediately without waiting for the timer to expire. This is termed early or fast retransmission.
Chapters
0:00 – 2:00 00:00-02:00
The lecture begins with a slide titled 'TCP Retransmission,' explaining that a lost segment causes the receiver to send an acknowledgement with the same ACK number. The instructor outlines two triggers for retransmission: 'Either Time Out Timer expire or it receives three duplicate acknowledgements.' The slide then transitions to 'Retransmission after Time out Timer Expiry,' showing a Sender-Receiver diagram. A red X marks the 'Lost Segment' before it reaches the receiver, while a timer icon tracks from 'Timer Starts' to 'Timer Expires.' A blue arrow labeled 'Retransmit Same Segment' illustrates the sender's action after expiry.
2:00 – 4:13 02:00-04:13
The instructor presents a worked example where 'Sender sends 5 TCP segments' and the second segment is lost. The receiver's behavior is detailed: it sends an original ACK for segment 1, followed by the '1st duplicate ACK' upon receiving segment 3. As segments 4 and 5 arrive, the receiver sends the '2nd' and '3rd duplicate ACKs,' all asking for segment 2. The diagram shows a red X over 'Segment 2' and labels reading '3 duplicate acks received.' The instructor concludes that the sender retransmits segment 2 without waiting for its timer to go off, a process identified as 'early retransmission or Fast retransmission.'
The lesson progresses from general TCP recovery principles to a specific fast retransmission scenario. The core concept is that TCP uses two distinct methods to handle packet loss: a passive timeout mechanism and an active fast retransmission triggered by duplicate ACKs. The worked example of five segments effectively demonstrates how the receiver's inability to process out-of-order data (segments 3-5) generates duplicate ACKs. This allows the sender to infer loss and act faster than a timeout would permit, which is central to maintaining efficient data flow.

