Answered: 5.04-3. Bellman Ford Algorithm - a…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

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

1
1
compute
9-
node i only
at t=0 the link (with a cost of
6) between nodes g and h
goes down
all nodes
8
node e only
1
6
b.
1
nodes i and e only
1
compute
h
1
nodes i and e and g only
1
1
node h does not send out its distance vector, since none of the least costs have changed
to any destination.
1
Not quote. This answer is incorrect.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 5 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions