5.04-4. Bellman Ford Algorithm - a change in DV (1, part 4). Consider the network below, and suppose that at t=0, the link between nodes b and c goes down. And so at t=0, node b recomputes its distance vector (DV) and sends out its new DV (as needed). At t=1 this new DV is received at b's neighbors, who then perform their calculation and send out their new DVs (as needed); these new DVs arrive at their neighbors at t=2, and so on. What is the last time in this network at which a DV calculation will take place as a result of the link change at t=0? 1 1 9. 02 at t=0 the link (with a cost of 1) between nodes b and c goes down 8 1 6 b compute 1 1 h H 1 1 an essentially infinite amount of time; this is the count-to-infinity problem

5.04-4. Bellman Ford Algorithm - a change in DV (1, part 4). Consider the network below, and suppose that at t=0, the link between nodes b and c goes down. And so at t=0, node b recomputes its distance vector (DV) and sends out its new DV (as needed). At t=1 this new DV is received at b's neighbors, who then perform their calculation and send out their new DVs (as needed); these new DVs arrive at their neighbors at t=2, and so on. What is the last time in this network at which a DV calculation will take place as a result of the link change at t=0? 1 1 9. 02 at t=0 the link (with a cost of 1) between nodes b and c goes down 8 1 6 b compute 1 1 h H 1 1 an essentially infinite amount of time; this is the count-to-infinity problem