Two-Node Loop Instability

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/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. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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
  15. Operating Systems: 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
  16. 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, Network Security, Cloud Computing and IoT, Cyber and Info Security
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…