Basics of time out timer

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/computer-networks/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. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. 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, Network Security, Cloud Computing and IoT, Cyber and Info Security
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…