Basic Algo for time out Timer
Duration: 7 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
The video lecture focuses on the algorithms used for dynamically computing the value of the Time Out Timer (TOT) in network protocols. The instructor begins by listing three primary methods: the Basic Algorithm, Jacobson's Algorithm, and Karn's modification. He explains that these algorithms adjust the timer value based on the actual round-trip time (ARTT) observed in the network. The core of the lecture details the 'Basic Algorithm,' outlining general rules where the timer is increased during high traffic (increased ARTT) and decreased during low traffic (decreased ARTT). The instructor then provides a concrete, step-by-step numerical example. He sets up a table to track the Initial Round-Trip Time (IRTT), Actual Round-Trip Time (ARTT), and the calculated Time Out Timer (TOT) for sequential segments. He demonstrates how to calculate the IRTT for the second segment using a smoothing factor formula, showing the arithmetic explicitly on the screen. Finally, he discusses the advantages, such as flexibility, and disadvantages, specifically the arbitrary nature of the factor of 2 used in the basic calculation, before briefly introducing Van Jacobson.
Chapters
0:00 – 2:00 00:00-02:00
The session opens with a slide titled 'Algorithms for Computing Time Out Timer Value.' The instructor introduces the topic by listing the specific algorithms used for dynamic computation: the Basic Algorithm, Jacobson's Algorithm, and Karn's modification. He sets the context that these algorithms are essential for managing network performance by adjusting timer values based on real-time conditions. The visual focus is on the bulleted list on the slide, which serves as the agenda for the lecture. The instructor emphasizes that the value of the time out timer is not static but changes dynamically based on network traffic. This introduction prepares the student for the detailed breakdown of each algorithm that follows.
2:00 – 5:00 02:00-05:00
The lecture transitions to 'General Rules for Algorithms (Basic algorithm).' Two specific rules are presented on the slide: Rule-01 states that the TOT for the next segment is increased if the ARTT for the previous segment increases, indicating high traffic. Rule-02 states the opposite: the TOT is decreased if the ARTT decreases, indicating low traffic. The instructor writes 'ToT' on the slide to emphasize the variable. He then moves to 'Step-01: Sending 1st Segment.' He explains that the sender assumes a random initial RTT (IRTT1) and sets the TOT1 to 2 times the IRTT1. To illustrate this, he draws a table with columns for Segment, IRTT, ARTT, and TOT. He populates the first row with hypothetical values: IRTT=10, ARTT=15, and TOT=20, explaining that the ACK arrives in 15 time units. This visual aid helps clarify the relationship between the variables.
5:00 – 7:28 05:00-07:28
The instructor proceeds to 'Step-02: Sending 2nd Segment.' He introduces the formula for computing the new initial RTT: IRTT_next = alpha * IRTT_n + (1 - alpha) * ARTT_n. He explains that alpha is a smoothing factor between 0 and 1. He performs a calculation on the screen using alpha=0.5, writing '5x10 + 5x15 = 12.5' to find the new IRTT. He updates the table with Segment 2 having an IRTT of 12.5 and a TOT of 25. He continues to fill the table for Segment 3. The lecture concludes this section by listing the advantages (flexibility, consideration of previous segments) and disadvantages (arbitrary factor of 2) of the Basic Algorithm. The final slide introduces Van Jacobson, a key figure in TCP/IP performance, setting the stage for the next topic.
The video provides a comprehensive overview of dynamic timer computation, starting with a list of algorithms and drilling down into the mechanics of the Basic Algorithm. It effectively bridges theoretical rules with practical calculation, showing how smoothing factors and historical data influence future timer settings. The progression from general rules to specific formulas and finally to a critique of the method offers a complete learning path for students studying network congestion control.