Periodic Vs Triggered Update

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-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 the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…