Basic Algo for time out Timer

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/tl-congestion-udp/timers-rtt-sws/asset-basic-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 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: Introduction to CN, Data Communication, 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

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

  1. 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. 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.

  3. 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.

Loading lesson…