Basic Algo for time out Timer

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: 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, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, अनुक्रम, श्रेणी और संयोजन / Sequences, Series and Combinatorics, मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…