Jacobson Algo for time out timer
Duration: 8 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a comprehensive overview of Van Jacobson's contributions to computer networking, specifically focusing on his algorithms for TCP/IP performance. The lecture begins by introducing Van Jacobson as a primary contributor to the TCP/IP protocol stack and an adjunct professor at UCLA. The core of the lesson details Jacobson's Algorithm, a modified version of the basic algorithm designed to improve performance in calculating Round Trip Time (RTT) and Time Out Timer (TOT). The instructor demonstrates the step-by-step calculation process for sending the first and second segments, utilizing a table to track Initial RTT (IRTT), Actual RTT (ARTT), and Deviation values. Finally, the video addresses the limitations of these algorithms when an Acknowledgment (ACK) arrives after a timeout, introducing Karn's modification as the solution to this specific problem.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a biographical slide about Van Jacobson, born in 1950. The text on the screen identifies him as an American computer scientist renowned for his work on TCP/IP network performance and scaling. It highlights that he is one of the primary contributors to the TCP/IP protocol stack, which serves as the technological foundation of today's Internet. Additionally, the slide notes that since 2013, Jacobson has been an adjunct professor at the University of California, Los Angeles (UCLA), where he works on Named Data Networking. The instructor is visible in the bottom right corner, preparing to discuss these technical contributions.
2:00 – 5:00 02:00-05:00
The lecture transitions to a slide titled 'Jacobson's Algorithm', stating it is a modified version of the basic algorithm that gives better performance. The instructor begins explaining 'Step-01: Sending 1st Segment'. He draws a table on the screen with columns labeled IRTT, ARTT, TOT, ID, and AR. He assumes an initial RTT (IRTT) of 10 and an initial deviation (ID) of 5. Using the formula TOT = 4 * ID + IRTT, he calculates the Time Out Timer as 30. He then assumes the ACK arrives at an Actual Round-Trip Time (ARTT) of 15. He calculates the Actual Deviation (AD) as the absolute difference between IRTT and ARTT, resulting in 5. This section establishes the foundational calculations for the algorithm.
5:00 – 7:46 05:00-07:46
The video proceeds to 'Step-02: Sending 2nd Segment', displaying formulas for updating IRTT and ID using a smoothing factor alpha. The formula for the new IRTT is IRTT_n+1 = alpha * IRTT_n + (1-alpha) * ARTT_n, and similarly for ID. The instructor explains that the sender sets the time out timer value (TOT) for the 2nd segment using the updated values. The lecture then shifts to 'Problems with Basic Algorithm and Jacobson's Algorithm'. It discusses the scenario where an ACK arrives after the initial time out timer goes off, necessitating retransmission. The key issue is that for the retransmitted segment, the ARTT is not available because the ACK is delayed. The slide concludes by stating that this problem is resolved by Karn's modification.
The lecture effectively bridges the gap between the historical figure of Van Jacobson and the practical application of his algorithms in network performance. By moving from a biographical introduction to a detailed, step-by-step calculation example, the instructor clarifies how Jacobson's Algorithm improves upon basic methods. The progression culminates in identifying the algorithm's limitations regarding retransmissions, setting the stage for further study on Karn's modification. This structure ensures students understand not just the 'how' of the calculations, but also the 'why' and the 'what next' in the context of TCP/IP reliability.