Periodic Vs Triggered Update
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), 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, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment introduces the two mechanisms by which a node in distance vector routing disseminates its partial routing table to immediate neighbors: periodic updates and triggered updates. The instructor presents a slide titled around routing-table updates, opening with the question of when a node sends its partial routing table (only two columns) to all immediate neighbors. The answer given is that it is sent both periodically and on change. Under “Periodic Update,” the slide states that a node sends its routing table normally every 30 s, with the period depending on the protocol using distance vector routing. The instructor hand-draws a circle around “every 30 s” and underlines “in a periodic update” to emphasize the fixed interval. Under “Triggered Update,” the slide states that a node sends its two-column table to neighbors anytime there is a change in its routing table. Two sub-bullets identify the causes of such changes: receiving a new table from a neighbor (after updating) and detecting link failure, which results in a distance change to infinity. A hand-drawn diagram shows a central node connected to multiple neighbors with arrows indicating table exchange, illustrating the network topology for these updates. The segment is a single-slide conceptual explanation with no worked numerical example; the key takeaway is the contrast between time-driven (every 30 s) and event-driven (on change, including link failure to infinity) update triggers in distance vector routing.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the slide on routing-table updates in distance vector routing, opening with the question of when a node sends its partial routing table (only two columns) to all immediate neighbors. The slide lists “Periodic Update” and “Triggered Update.” Visible text reads “A node sends its routing table, normally every 30 s, in a periodic update.” Around 65s the instructor hand-draws a circle around “every 30 s” and underlines “in a periodic update,” emphasizing the fixed interval. The presenter in a black KG polo explains that updates occur both periodically and on change, setting up the two update types.
2:00 – 4:30 02:00-04:30
The instructor elaborates the two update mechanisms. The “Periodic Update” bullet states a node sends its routing table normally every 30 s, with the period depending on the protocol using distance vector routing. The “Triggered Update” bullet states a node sends its two-column table to neighbors anytime there is a change in its routing table, followed by sub-bullets: receiving a neighbor's table (after updating) and detecting link failure. The slide notes a triggered update “can result from the following” causes, including “a distance change to infinity.” A hand-drawn diagram shows a central node connected to multiple neighbors with arrows indicating table exchange, illustrating the topology. The segment concludes by contrasting time-driven periodic updates with event-driven triggered updates.
The core concept is that distance vector routing nodes propagate their partial (two-column) routing tables to immediate neighbors via two complementary triggers. Periodic updates are time-driven: a node sends its table normally every 30 s, though the exact period depends on the specific protocol. Triggered updates are event-driven: a node sends its table to neighbors immediately whenever there is a change in its routing table. Two causes of such changes are identified: (1) receiving a new table from a neighbor, which may prompt an update after the node updates its own table, and (2) detecting a link failure, which causes a distance to change to infinity. A hand-drawn diagram of a central node with arrows to multiple neighbors visualizes the table-exchange topology. The pedagogical emphasis, reinforced by circling “every 30 s” and underlining “in a periodic update,” is on distinguishing the fixed-interval mechanism from the change-triggered mechanism. No numerical worked example is shown; the lesson is conceptual, defining when and why updates are sent.

