Consider the following network (Figure 1). With the indicated link costs, use Dijkstra's shortest-path (link state) algorithm to compute the shortest path from A to all network nodes.
Figure 1:
1-1) Show how the algorithm works by computing the below table:
Step D(B) P(B) D(C) P(C) D(D) P(D) D(E) P(E)
5 A 2 A 8 A
1-2) Create shortest-path tree from A
1-3) Create forwarding table of "A" based on the above table:
Destination Link