Karn's Algorithm for Time out Timer

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/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-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), 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, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…