Jacobson Algo for time out timer

Duration: 8 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-jacobson-algo-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.

The lecture introduces Van Jacobson, an American computer scientist born in 1950, highlighting his contributions to the TCP/IP protocol stack and Named Data Networking. The core topic is Jacobson's Algorithm for calculating the timeout timer (TOT) in TCP, which improves upon basic algorithms by dynamically adjusting RTT and deviation estimates. The instructor presents Step 01, where the sender assumes an initial round-trip time (IRTT) and initial deviation (ID) to calculate the first timeout timer using the formula TOT_1 = 4 x ID_1 + IRTT_1. A numerical example is worked out using a hand-drawn table, with IRTT set to 10 and ID to 5, resulting in a TOT of 30. The actual deviation (AD) is calculated as the absolute difference between IRTT and the measured RTT. The lecture then transitions to Step 02, introducing smoothing formulas for subsequent segments: IRTT_{n+1} = α IRTT_n + (1 - α) ARTT_n and ID_{n+1} = α ID_n + (1 - α) AD_n. Finally, the video addresses problems with the basic algorithm, specifically when an ACK arrives after a timeout has already occurred. Karn's modification is introduced as the solution to this issue, ensuring that delayed ACKs do not corrupt RTT estimates.

Chapters

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

    The lecture begins by introducing Van Jacobson (born 1950) as an American computer scientist renowned for his work on TCP/IP network performance and scaling. A slide displays a NIST photo with red pen underlines emphasizing his birth year, profession, and contributions. The instructor uses a drawing toolbar to add annotations, including a blue arrow pointing at the photo. This section establishes Jacobson's authority before transitioning to his algorithm, which is described as a modified version of the basic timeout calculation that provides better performance. The text on screen explicitly lists his role in the TCP/IP protocol stack and Named Data Networking at UCLA.

  2. 2:00 – 5:00 02:00-05:00

    The focus shifts to Step 01 of Jacobson's Algorithm: Sending the 1st Segment. The slide presents the formula TOT_1 = 4 x ID_1 + IRTT_1 and AD_1 = |IRTT_1 - ARTT_1|. The instructor draws a red table with columns for IRTT, Actual RTT (ARTT), TOT, ID, and AR. Using a numerical example, the instructor fills in IRTT = 10 and ID = 5, calculating a TOT of 30. The actual deviation AD_1 is computed as |10 - 15| = 5 when the measured RTT is 15. The lecture then introduces Step 02 for subsequent segments, displaying the smoothing formulas IRTT_{n+1} = α IRTT_n + (1 - α) ARTT_n and ID_{n+1} = α ID_n + (1 - α) AD_n. The instructor calculates a new RTT of 14.5 for the second segment, demonstrating how the algorithm updates estimates over time.

  3. 5:00 – 7:47 05:00-07:47

    The lecture concludes by discussing limitations of the basic and Jacobson algorithms. A slide titled 'Problems with Basic Algorithm and Jacobson's Algorithm' appears, focusing on the scenario where an ACK arrives after a timeout has already occurred. The instructor explains that using such delayed ACKs to update RTT estimates can lead to inaccurate calculations and potential performance degradation. Karn's modification is introduced as the standard solution to this problem, which involves ignoring RTT samples from retransmitted segments. The hand-drawn table and circled formulas remain visible, reinforcing the connection between the mathematical model and its practical implementation in TCP. This section highlights the importance of robust timeout management in network protocols.

The lecture provides a structured overview of Jacobson's Algorithm for TCP timeout management, moving from biographical context to mathematical formulation and practical application. The central idea is that dynamic adjustment of RTT and deviation estimates leads to more efficient timeout timers compared to static values. The teaching flow follows a logical progression: establishing authority (Jacobson's background), defining the initial state (Step 01 with assumed IRTT and ID), demonstrating calculation through a numerical example, introducing iterative updates (Step 02 with smoothing factors), and addressing edge cases (Karn's modification for delayed ACKs). Key formulas include the initial timeout calculation TOT_1 = 4 x ID_1 + IRTT_1 and the recursive update equations using smoothing factor α. The hand-drawn table serves as a visual anchor for the numerical example, making abstract concepts concrete. Karn's modification is presented not just as a fix but as an essential component of robust TCP implementation, ensuring that RTT estimates remain accurate even in lossy network conditions. The lecture effectively balances theoretical foundations with practical considerations, preparing students to understand both the 'how' and 'why' of TCP timeout management.

Loading lesson…