Periodic Vs Triggered Update

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/net-layerrouting-protocol/dvr-rip-split-horizon/asset-periodic-vs-triggered-update after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length 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

  1. 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. 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.

Loading lesson…