• Find the shortest path from node A to every other router in the network. Illustrate the SPT using Dijkstra algorithm (Show them the steps (Table) similar to chart #27 of the Routing Algorithm charts posted)
Answer:
• Apply the Bellman ford algorithm (Distance Vector) to the following network.
Example of iteration: Router D send his DV to E
Example of iteration: Router B sends his DV to A
Example of iteration: Router E sends his updated DV (i.e. after the first iteration) to A
The final DV is table is shown below
If link between A and E fails