Basics of time out timer

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-data-communication-network/tl-congestion-udp/timers-rtt-sws/asset-basics-of-time-out-timer after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces the fundamentals of timeout timer configuration in computer networks, contrasting the simplicity of data link layer timing with the complexity required at the transport layer. The instructor presents core propagation and round-trip time formulas, emphasizing that timeout values must be dynamic rather than static. The discussion then transitions to how network traffic conditions—high versus low—affect ACK delivery and timer sizing, before concluding with an overview of three dynamic computation algorithms: the Basic Algorithm, Jacobson's Algorithm, and Karn's modification.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The opening slide, titled "Timer," explains that timer setting in the data link layer was simple because it concerned only adjacent nodes. It displays three key formulas: "Tp = d/v," "Rtt = 2 X Tp," and "Tot = 2 X Rtt." The instructor uses red hand-drawn circles to highlight the phrase "data link layer" and each of the three equations, adding a small red arrow beside the Rtt line. A second bullet notes that in the Transport layer, handling this is a complex task involving multiple layers, networks, and different paths; a red strikethrough is drawn over "Transport layer." A third bullet states, "One important conclusion that the value of time out timer should not be static it should change with situation," reinforcing the need for adaptive timing.

  2. 2:00 – 3:37 02:00-03:37

    The slide switches to "Network Traffic And Time Out Timer," which walks through high-traffic and low-traffic cases for the ACK reaching the sender. Red diagonal strikethroughs are drawn over both "High traffic" and "Low traffic" labels as the explanation proceeds, with on-screen text noting consequences such as "If the value is kept small" and "If the value is kept large." The final slide, headed "Algorithms for Computing Time Out Timer Value," states that algorithms used for computing the value dynamically are: Basic Algorithm, Jacobson's Algorithm, and Karn's modification. Red tick marks appear beside each item sequentially, with the third mark added by 205s to complete the list.

The lesson progresses from foundational timing formulas at the data link layer to the rationale for dynamic timeout adjustment. The instructor visually emphasizes key terms and equations with red annotations, then connects traffic variability to timer sizing trade-offs. The segment closes by naming three specific algorithms for dynamic computation, setting up subsequent detailed study of each method.

Loading lesson…