Karn's Algorithm for Time out Timer

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-data-communication-network/tl-congestion-udp/timers-rtt-sws/asset-karns-algorithm-for-time-out-timer after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, 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, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces Karn's Algorithm for TCP timeout timers, focusing on the limitations of basic and Jacobson's algorithms. The instructor explains that both prior methods rely on the actual round-trip time (ARTT) of previous segments to calculate the initial round-trip time (IRTT), using the formula IRTT_{n+1} = α IRTT_n + (1 − α) ARTT_n. A critical problem arises when a segment is retransmitted after its timeout expires: the acknowledgment (ACK) arrives too late to provide a valid ARTT measurement, making standard updates unreliable. The instructor demonstrates this with a numerical example, showing how IRTT values shift from initial estimates (e.g., 10 and 15) to updated figures (12.5 and 25) when invalid data is incorporated. Karn's modification, proposed by Phil Karn and Craig Partridge in 1987, resolves this issue. The core rule is that when a segment is retransmitted due to timeout, the sender must not use the resulting ACK's RTT for estimation; instead, it should double the timeout timer (TOT) to account for potential congestion. This approach prevents skewed IRTT calculations and improves TCP reliability.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The slide titled 'Problems with Basic Algorithm and Jacobson's Algorithm' presents the core issue: both algorithms depend on previous ARTT via IRTT_{n+1} = α IRTT_n + (1 − α) ARTT_n. The instructor uses red pen to underline 'Basic Algorithm' and cross out the α IRTT_n term, emphasizing the dependency problem. A numerical example follows where initial IRTT values of 10 and 15 are crossed out and replaced with 12.5 and 25, illustrating how invalid ACKs after timeout corrupt the estimate. The slide notes that 'Consider ACK of some segment arrives to the sender after its initial time out timer goes off,' highlighting why standard updates fail in retransmission scenarios.

  2. 2:00 – 2:57 02:00-02:57

    The lecture transitions to Karn's solution with a slide stating that Karn's algorithm estimates round-trip time for TCP messages, proposed by Phil Karn and Craig Partridge in 1987. Red annotations underline 'Karn' and 'Craig Partridge,' with an arrow pointing to a portrait. The next slide, 'Karn's Modification,' lists the key rule: when a segment is retransmitted (underlined in red), do not use its ACK for RTT estimation. Instead, double the timeout timer (TOT), as emphasized by a red underline and curved stroke beneath 'time out timer (TOT).' Red X marks over 'Basic' and 'Jacobson's' reinforce that this modification supersedes earlier approaches.

The lesson progresses from problem identification to solution. First, it establishes that basic and Jacobson's algorithms fail when ACKs arrive after timeout because they incorporate invalid ARTT data into IRTT calculations. The numerical example concretizes this flaw by showing how estimates drift when corrupted data is used. Karn's modification then provides a clear corrective rule: ignore RTT measurements from retransmitted segments and double the timeout timer instead. This two-part strategy—excluding invalid data and adjusting for congestion—ensures more accurate IRTT estimation. The instructor's red pen annotations (cross-outs, underlines, arrows) visually reinforce these key points, distinguishing the problematic terms in the formula and highlighting Karn's specific modifications. The content is grounded entirely in visible slide text and annotations, with no audio transcript available to confirm additional verbal explanations.

Loading lesson…