Question: Problem (a) Consider the network below: 6 N CZ 2 2 3 Using link state algorithm and how all your work compute the shortest path

Problem (a) Consider the network below: 6 N CZ 2 2 3 Using link state algorithm and how all your work compute the shortest path from node Z to all the other nodes in the network shown above. List the shortest path from node Z to all the other nodes. (10 pts) Hint: You can create and use a table similar to the homework assignment to guide your thought process. (b) Use the same network topology from part(a) above. For a synchronous version of the distance vector algorithm, compute the distance tables at all 5 modes in the first two steps (the initialization step and one additional step) of the algorithm (15 pts) Hint: Once again you can create and use table formats from your homework assignment to help guide your thought process and report your results
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
