Answer C
Simple explanation of count to infinity problem
- The core of the count-to-infinity problem is that if A tells B that it has a path somewhere, there is no way for B to know if the path has B as a part of it.
- To see the problem clearly, imagine a subnet connected like A–B–C–D–E–F,
- . Now suppose that A is dead.
- In the vector-update-process B notices that the A is down.
- The problem is, B also gets an update from C, and C says B that A is only two hops from C (C to B to A), which is false.
- Since B doesn't know that the path from C to A is through itself (B), it updates its table with the new value "B to A = 2 + 1". Later on, B forwards the update to C and due to the fact that A is reachable through B (From C point of view), C decides to update its table to "C to A = 3 + 1".
- This slowly propagates through the network until it reaches infinity.