Karn's Algorithm for Time out Timer
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), 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, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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
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: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.

