5.04-1. Bellman Ford Algorithm (1, part 1). 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 1 after e has received the distance vectors from its neighbors and updated its own distance vector.
5.04-1. Bellman Ford Algorithm (1, part 1). 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 1 after e has received the distance vectors from its neighbors and updated its own distance vector.
Related questions
Question
5.04-1. Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at t=1, node e receives distance
Transcribed Image Text:DV in d:
De(a) = 1
Dd(b) = ∞
Dd(c) = 00
Da(d) = 0
Dale) = 1
Do (f) = ∞
Da(g) = 1
Da(h) = 00
Do(i) = 00
DV in h:
D₁(a) = ∞
D₁(b) = 00
D₁(c) = 00
Dn(d) = ∞0
Dn(e) = 1
D₁(f) = 00
D₁(g) = 1
D₁(h) = 0
Dh(i) = 1
De(g)
De(f)
De(b)
De(a)
De(c)
De(i)
De(d)
De(h)
at t=1 e receives
DVS from b, d, f, h
8
1
b.
1
Q: what is new DV computed in e at
t=1?
compute
DV in b:
Db(a)=8 D₁(f) = ∞
Db(c) = 1
Db(g) = ∞0
D₂(h) = 00
D₂(i) = 00
-h
Do(d)=∞
Db(e) = 1
1
1
1
old DV at e
DV in e:
De(a)=00
De(b) = 1
De(C) = 00
De(d) = 1
De(e) = 0
De(f) = 1
De(g) = ∞0
De(h) = 1
De(i) = 00
DV in f:
Di(a) = ∞
D₁(b) = ∞
D/(c) = ∞
Di(d) = ∞
Di(e) = 1
Di(f) = 0
= ∞
D(g):
Di(h) = 00
D(i) = 1
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 18 images
