5.04-3. Bellman Ford Algorithm - a change in DV (1, part 3). Consider the network below, and suppose that at t=0, the link between nodes g and h goes down. And so at t=0, nodes g and h recompute their DVs. Following this recomputation, to which nodes will h send its new distance vector? (Note: to answer this question, you'll need to know some of the DV entries at g and h at t=0, but hopefully they'll be obvious by inspection).

icon
Related questions
Question
**5.04-3. Bellman Ford Algorithm - a change in DV (1, part 3)**

Consider the network below, and suppose that at t=0, the link between nodes g and h goes down. And so at t=0, nodes g and h recompute their distance vectors (DVs). Following this recomputation, to which nodes will h send its new distance vector? (Note: to answer this question, you’ll need to know some of the DV entries at g and h at t=0, but hopefully they’ll be obvious by inspection).

**Diagram Explanation:**

The diagram is a network of nodes labeled from 'a' to 'i'. Each line represents a link between two nodes with an associated cost. For instance, the link between node 'a' and node 'b' has a cost of 8. At the center, there is a broken link between nodes 'g' and 'h' with a cost of 6, indicating that this link has gone down at t=0. Nodes 'g' and 'h' are in a state of computation which is illustrated with a “compute” label and yellow explosion graphics around them.

**Answer Options:**

- node i only
- node e only
- all nodes
- node h does not send out its distance vector, since none of the least costs have changed to any destination.
- nodes i and e only
- nodes i and e and g only

The correct choice would involve analyzing the impact of the link failure on node h's distance vector and to which nodes the updated vector should be sent.
Transcribed Image Text:**5.04-3. Bellman Ford Algorithm - a change in DV (1, part 3)** Consider the network below, and suppose that at t=0, the link between nodes g and h goes down. And so at t=0, nodes g and h recompute their distance vectors (DVs). Following this recomputation, to which nodes will h send its new distance vector? (Note: to answer this question, you’ll need to know some of the DV entries at g and h at t=0, but hopefully they’ll be obvious by inspection). **Diagram Explanation:** The diagram is a network of nodes labeled from 'a' to 'i'. Each line represents a link between two nodes with an associated cost. For instance, the link between node 'a' and node 'b' has a cost of 8. At the center, there is a broken link between nodes 'g' and 'h' with a cost of 6, indicating that this link has gone down at t=0. Nodes 'g' and 'h' are in a state of computation which is illustrated with a “compute” label and yellow explosion graphics around them. **Answer Options:** - node i only - node e only - all nodes - node h does not send out its distance vector, since none of the least costs have changed to any destination. - nodes i and e only - nodes i and e and g only The correct choice would involve analyzing the impact of the link failure on node h's distance vector and to which nodes the updated vector should be sent.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS