Different timers used in transport layer
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
- Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- DBMS (Technical): 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
- SQL (Technical): SQL
- Operating Systems (Technical): 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
- Computer Networks (Technical): 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
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This academic lecture segment focuses on TCP timers used in network protocols to manage connection states and reliability. The instructor systematically explains the Time-wait timer to handle late packets, the Keep-alive timer for closing idle connections, and briefly introduces Persistent, Acknowledgement, and Time-out timers. The visual aids consist of bullet points on a white background, with the instructor actively underlining key terms and drawing diagrams to clarify concepts like piggybacking. The branding "Knowledge Gate Educator" and "Sanchit Jain Sir" is visible in the corner, identifying the source of the lecture. The instructor is wearing a black t-shirt with the logo.
Chapters
0:00 – 2:00 00:00-02:00
The session begins with the "Time-wait timer" slide, subtitled "(Take care of late packets)". The instructor emphasizes the text "never close connection immediately," explaining that doing so makes the port number available for other processes. He underlines the phrase "port no will be available for some other process" to stress this risk. The slide notes that "generally we wait for 2*LT" to ensure late packets are handled correctly. The instructor gestures to emphasize that if a packet arrives late after the connection is closed, "there will a problem." He underlines "2*LT" and "problem" to highlight the consequences of premature closure.
2:00 – 5:00 02:00-05:00
The topic shifts to the "Keep-alive timer(Close idle connections)". The slide states the server "periodically check connection and close them." The instructor underlines "Sever periodically check connection" and "close them." He details a specific mechanism where, "After keep-alive time duration, server sends 10 probe messages with a gap of 75 seconds." He circles "10 probe messages" and draws a red cross to indicate the failure condition: "in case of no reply, will close the connection." This section focuses on cleaning up stale connections and preventing resource leaks on the server side.
5:00 – 6:32 05:00-06:32
The final segment introduces three more timers. "Persistent timer" is linked to "Window size zero advertise," which the instructor underlines. "Acknowledgement time" is described as a timer used to "generate cumulative ack mostly in piggybacking mode." The instructor draws a diagram with boxes and arrows to visualize this piggybacking process, showing data segments and acknowledgments. Finally, "Time-out timer" is listed with the note "will be discussed in detail in next section," which the instructor circles to mark it as a future topic. He underlines "Time-out timer" and the description below it, signaling its importance.
The lecture provides a structured overview of TCP timers, moving from connection termination safety (Time-wait) to resource management (Keep-alive) and flow/reliability mechanisms (Persistent, Ack, Time-out). The instructor uses visual annotations to highlight critical parameters like the 2*LT wait time and the 10 probe messages, ensuring students grasp the specific operational details of each timer. The progression sets up a deeper discussion on Time-out timers in the subsequent section.

