Karn's Algorithm for Time out Timer

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/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. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/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 Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
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…