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 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). at t=0 the link (with a cost of 6) between nodes g and h goes down a -- 8 -- b -- 1 -- c | | 1 1 | | d -- 1 -- e -- 1 -- f | | | 1 1 1 | | | compute g compute h -- 1 -- i all nodes nodes i and e and g only node e only nodes i and e only node i only node h does not send out its distance vector, since none of the least costs have changed to any destination.

          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).

at t=0 the link (with a cost of 6) between nodes g and h goes down

a -- 8 -- b -- 1 -- c
|          |
1          1
|          |
d -- 1 -- e -- 1 -- f
|          |          |
1          1          1
|          |          |
compute g  compute h -- 1 -- i

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

Show more…

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).

at t=0 the link (with a cost of 6) between nodes g and h goes down

a – 8 – b – 1 – c
| |
1 1
| |
d – 1 – e – 1 – f
| | |
1 1 1
| | |
compute g compute h – 1 – i

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

Added by Joel K.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

08/07/2023

Step 1

At t=0, the link between nodes g and h goes down. This means that the cost of the link between g and h is now infinite (or very high). Show more…

Show all steps

lock

Thanks for your feedback!

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). At t=0, the link (with a cost of 6) between nodes g and h goes down. all nodes nodes i and e and g only node e only nodes i and e only node i only node h does not send out its distance vector, since none of the least costs have changed to any destination.

Play audio

Feedback

Powered by NumerAI

Akash M and 91 other subject AP CS educators are ready to help you.

Ask a new question

Labs

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

Key Concepts

Recommended Videos

Recommended Textbooks

Transcript

00:01 In this question, let us first see what is given to us in the question and it is asked, the question is asked to us regarding the data that is given.

00:12 So first we have said that at t is equal to 0, when the link between nodes g and h goes down.

00:23 So the link between the nodes that are there, the nodes are g and h.

00:39 So the link between these two, when it goes down, then the nodes g and h that are there, they will recompute their distant vectors.

00:54 So they will recompute, they will recompute their distance vectors, that is dvs.

01:19 So they will recompute their distance vectors and they will propagate the change to their neighbours.

01:28 They will propagate the changes to their neighbours.

01:47 So we have to see now further the explanation for this.

01:54 So now what i can say is, since we don't have the full network topology and the dv, that is the distance vectors entry that is there, that are entries for nodes g and h at t, we can infer from the behaviour based on the common routing algorithms like the bellman -ford algorithm.

02:19 So the bellman -ford algorithm, which is also mentioned in the question itself to us.

02:31 So according to this algorithm or referring to this algorithm, we will proceed further.

02:38 So we will see that when the link between g and h that is there, when it goes down, then the node h will update its dv to reflect the fact that the cost to reach each node g is now infinity...

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later