Basic Algo for time out Timer

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/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. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
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…