Answered: Bellman Ford Algorithm (1, part 2).…

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-2. Bellman Ford Algorithm (1, part 2). Consider the scenario shown below, where at t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The (old) distance vector at e (the node at the center of the network) is also shown, before receiving the new distance vector from its neighbors. Indicate which of the components of new distance vector at e below have a value of 2 after e has received the distance vectors from its neighbors and updated its own distance vector.

DV in d:
Dd(a) = 1
Dd(b) = 00
Dd(c) = ∞
Dd(d) = 0
Dale) = 1
Dd(f) = ∞
Da(g) = 1
Do(h) = 00
Do(i) = ∞
DV in h:
D₁(a) = ∞
D₁(b) = 00
Dh(c) = 00
Dh(d) = 00
D₁(e) = 1
D₁(f) = 00
Dn(g) = 1
Dm(h) = 0
Dh(i) = 1
De(g)
De(a)
De(i)
De(b)
De(c)
De(f)
De(h)
De(d)
1
at t=1 e receives
DVS from b, d, f, h
8
1
1
compute
1
Q: what is new DV computed in e at
t=1?
-h
Db(a)=8
Db(c) = 1
Do(d) = ∞
Db(e) = 1
1
DV in b:
1
D₂(f) = ∞0
Db(g) = 00
D₁(h) = ∞0
D₂(i) = 00
1
old DV at e
DV in e:
De(a) = ∞
D₂(b) = 1
De(c)
De(d) = 1
De(e) = 0
De(f) = 1
= ∞0
De(g)
De(h) = 1
De(i) = ∞
DV in f:
Di(a) = ∞
D₁(b) = 00
D(c) = 00
Di(d) = ∞
Di(e) = 1
Di(f) = 0
= ∞
Dig)=
Di(h) = 00
D(i) = 1

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 images

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