5) (15 points) In Fig.3 you have the topology of a certain network. Construct the forwarding table for all of the router

[answerhappygod]

5 15 Points In Fig 3 You Have The Topology Of A Certain Network Construct The Forwarding Table For All Of The Router 1 (150.63 KiB) Viewed 39 times

5) (15 points) In Fig.3 you have the topology of a certain network. Construct the forwarding table for all of the routers towards all the other routers in the network using the Bellman-Ford's algorithm. You can assume that all the routers send their newly computed/changed distance vectors (DV's) values to their neighbor at the same time, i.e. for t=0 all of them have only the DVs for their neighbors, at t=1 they do the first exchange of DVs, at t=2 they do the second exchange of DVs, etc. Show all of the steps until the algorithm converges for all of the routers (i.e. there are no more changes in DVs)! (Note: if everything as done correctly, you shouldn't have more to do more than 3 iterations (including the initialization) for any of the routers.) (Hint: fill-up the all of the tables below corresponding to new DV values after an exchange with the neighbors. The initial tables for all of the routers are given.) y 2 1 X Z 7 Fig.3. Topology of a certain network Dx() X Y Z Dy() X Y Z Dz() X Y Z X 02 7 X X Y Y 201 Y ∞ Z Z ∞ Z 7 1 0 DV table of X DV table of Y DV table of Z Dx() X Y Z Dy() X Y Z Dz() X Y Z X X X Y Y Y Z Z Z DV table of Y DV table of Z DV table of X Dx() X Y Z Dy() X Y Z Dz() X Y Z X X X Y Y Y Z Z Z DV table of X DV table of Y DV table of Z t=0 t=1 t=2