Two-Node Loop Instability

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layerrouting-protocol/dvr-rip-split-horizon/asset-two-node-loop-instability after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces two-node loop instability in distance-vector routing, explaining why a broken link (cost infinity) is not recognized immediately because the algorithm reports minimum costs first. The instructor uses a five-panel diagram of nodes A and B reaching node X to show how asynchronous table exchanges cause the cost to reach X to increase gradually until infinity, a problem called count-to-infinity.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The slide titled "Two-Node Loop Instability" states that if a link is broken (cost becomes infinity), every other router should be aware immediately, but distance-vector routing takes time because the algorithm reports the minimum first. The instructor introduces a network diagram with nodes and arrows to visualize how routers can incorrectly route traffic back and forth, naming the issue "count to infinity."

  2. 2:00 – 5:00 02:00-05:00

    The lecture walks through a two-node example with A and B connected to X. On-screen text says "Initially in fig.(a) nodes A and B know how to reach node X," then the link between A and B fails. If A sends its table immediately, everything is fine; instability occurs if B sends its forwarding table to A first. Node A assumes B found a path to X and updates, then B does the same, so "The cost of reaching X increases gradually until it reaches infinity." Panels a–e show tables before failure, after link failure, after A is updated by B, after B is updated by A, and finally.

  3. 5:00 – 5:38 05:00-05:38

    The instructor continues emphasizing the five-panel diagram, with red hand-drawn circles and crosses marking changing table entries such as around "1/3/A" and a crossed-out X. The final point is that at the moment the cost reaches infinity, both A and B know X cannot be reached. The slide reiterates that the cost of reaching X increases gradually until it reaches infinity.

The central idea is that distance-vector routing's reliance on minimum-cost reporting creates a delay in propagating link failures, producing count-to-infinity. The worked example uses nodes A and B reaching X: before failure both know a path; after the A-B link fails, asynchronous updates make each node believe the other has a valid route. Each update increases the recorded cost step by step until infinity, at which point both nodes recognize X is unreachable. The five-panel sequence (a–e) and red annotations on table values are the key evidence for this progression.

Loading lesson…