Which outcome occurs when a network router's path selection uses a distance-vector routing algorithm with poisoned reverse?

💡 Explanation

A poisoned reverse path selection algorithm prevents two-node count-to-infinity problems because a router advertises a route to a neighbor as unreachable if that neighbor is its next hop for that route. Therefore, the instability is avoided, rather than occurring, and better path determination results than simple distance vector routing.

• If a Las Vegas algorithm runs for an unusually long duration on an embedded system, which consequence follows?
• If a lossless data compression scheme encodes a text file using Huffman coding based on Shannon's source coding theorem, which consequence follows?
• A rubber sheet, initially a square, undergoes continuous deformation. Which outcome always maintains topological equivalence with the original square?
• Why does a resource allocation graph fail to be represented as a bipartite graph when detecting deadlocks?
• An automated theorem prover evaluates logical statements in a circuit design. Which outcome definitively indicates that a propositional formula is a tautology?
• A network of interconnected computers is designed such that every computer is connected to at least 'd' others. Which outcome regarding communication resilience occurs as 'd' increases?