Periodic Vs Triggered Update

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/data-communication-networking-it-specialist/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. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, 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), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): 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
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): 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
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): 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
  17. Descriptive Test (Main Exam): English Writing Ability
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…