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
- About Course: About the Course
- Paper-2 | 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
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Paper-2 | 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), 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, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
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.

