Content deleted Content added
→Count-to-infinity problem: Remove "which is false" from the sentence as it is not the case in the network. Though it is true in the context of router B, it isn't true in the context of router C as C still sees a valid path from B. The paragraph should be rephrased this way as it will give a better idea about the algorithm. |
Correct the mistake in comment explaining how node A updates its shortest path to D when it receives the distance vector from B. |
||
Line 310:
|colspan=5| Again, all the routers have gained in the last iteration (at T=1) new "shortest-paths", so they all broadcast their DVs to their neighbors; This prompts each neighbor to re-calculate their shortest distances again.
For instance: A receives a DV from B that tells A there is a path via
|
|-
| |||