# Question: Consider the below topology with the given costs of each link. Assume the Distance Vector algorithm runs in each router. Compute the distance tables after the initialization step and after each iteration of the asynchronous version of the DV algorithm. -Free Course Hero Question Answer.

Question Description: Consider the below topology with the given costs of each link. Assume Distance Vector algorithm runs in each router. Compute the distance tables after the initialization step and after each iteration of a synchronous version of the DV algorithm.

**Course Hero** **Answer & Explanation**:

Image transcription text

Distance Vector Algo du (4 ) = tiny & C (n, v) + dv(3)} 7 Nodex table cost to to min ( 3 to , 4 + 6 ) = 3 XYZ 6 3 4 XY/ z 7 min ( 3 + 6 , 4 +0 ) = 4 y ON 00 00 X 0 3 4. ) y Z 2 0 6 4 60 2) Node y table mis ( 6+ 4, 370 ) = ] cost to y z cost / to X/ Y Z X .0 - 0 fa 3 O 4 bo 3 Node Z tale cost to cott to XYZ X Y Z .0 .0 .0 X 0 3 # 4 3 0 6 6 2 4 60 Z 3 min ( 4+ 3 , ( +0 ) = L main (6+ 3, 4+01 =4