(i) Apply Dijkstra's Algorithm to the network shown to find the least cost paths from Node A to all
the other nodes of the network. Show all the steps of the procedure in detail (cost and path
at each step) and draw the corresponding tree from Node A to the other nodes of the
network. Give the forwarding table that Node A will use to send packets to the other nodes.
If Node A wants to multicast to all the other nodes, what would be the cost of doing this
using the router set up obtained in the previous step?
(i) Apply Dijkstra's Algorithm to the network shown to find the least cost paths from Node A to all the other nodes of the network.Show all the steps of the procedure in detail cost and path at each step) and draw the corresponding tree from Node A to the other nodes of the network. Give the forwarding table that Node A will use to send packets to the other nodes If Node A wants to multicast to all the other nodes, what would be the cost of doing this using the router set up obtained in the previous step?
7
H
-
1