Compute the distance vector at Node C and D during the round T=1 in the example of the Distance-Vector routing algorithm in the lecture note. Show the process of updating each value in the distance vector table of those two nodes.

  
 
 

Transcribed Image Text:

Distance-Vector Algorithm T=0 Initialization: For all destinations Y in N do If Y is a neighbor of X DX(Y) = c(X, Y) Else c(X, Y) = ∞ 2 DV at Node A A DA(A) = 0 BD₂(B) = 2 C DA(C) = 7 D DA(D) = 00 B 7 DV at Node B A DB(A) = 2 B DB(B) = 0 C D DB(C) = 1 DB(D) = 00 DV at Node C A Dc(A) = 7 B Dc(B) = 1 C Dc(C) = 0 D Dc(D) = 1 wp DV at Node D A DD(A) = 00 B DD(B) = C DD(C) = 1 D DD (D) = 0 9 Distance-Vector Algorithm T=0 Initialization: For all destinations Y in N do If Y is a neighbor of X DX(Y) = c(X, Y) Else c(X, Y) = ∞ 2 DV at Node A A DA(A) = 0 BD₂(B) = 2 C DA(C) = 7 D DA(D) = 00 B 7 DV at Node B A DB(A) = 2 B DB(B) = 0 C D DB(C) = 1 DB(D) = 00 DV at Node C A Dc(A) = 7 B Dc(B) = 1 C Dc(C) = 0 D Dc(D) = 1 wp DV at Node D A DD(A) = 00 B DD(B) = C DD(C) = 1 D DD (D) = 0 9

Answer rating: 100% (QA)

Answer In Round T 1 hode C have its neighbors node AB and D Distance vector table informati... View the full answer