Q2: Using the Link State routing algorithm (Dijkstra's Algorithm), build (fill in) the routing table for Node A for the network topology shown in Figure below, where. - D(v): Cost of the least-cost path from the source node to destination node v as of this iteration of the algorithm -- p(v): Previous / Predecessor node (neighbor of v) along the current least-cost path from the source to v. N': Subset of nodes whose least cost path is definitively known. (i.e., v is in N' if the least- cost path from the source to v is definitely known.)
2
5
B
3
Topology
First row (Step 0) has been filled for you.
Step N'
D(B), v(B)
D(B), v(B)
D(B), v(B)
D(B), v(B)
D(B), v(B)
D(B), v(B)
0 1
A
2,A
8
3,A
8
8
8
2
3 4
5
6
Page