This is a network with five routers configured to run Bellman-Ford algorithm. Shown next to it is the distance table of z at time t = 0 (i.e., DV exchanges have not started yet). As you can see, z knows the distance to its neighbors but does not know the DVs of its neighbors. Compute z's distance table entries after iterations t = 1, 2, and 3. 

Transcribed Image Text:

2 1 3 6 from\to V X Z C 8 8 8 > X y z 00 8 8 8 2000 2 1 3 6 from\to V X Z C 8 8 8 > X y z 00 8 8 8 2000