recategorized
2,111 views

2 Answers

3 votes
3 votes

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.
Answer:

Related questions

1 votes
1 votes
2 answers
1
1 votes
1 votes
2 answers
2
1 votes
1 votes
1 answer
3
go_editor asked Jul 20, 2016
1,424 views
What is the maximum length of CAT-5 UTP cable in Fast Ethernet network?100 meters200 meters1000 meters2000 meters
1 votes
1 votes
1 answer
4
go_editor asked Jul 20, 2016
2,828 views
In ______ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generated.Non-persistent0- persi...