Jacobson Algo for time out timer
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: 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) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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 Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
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
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: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.
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.

