Question

Consider the following network.

12 ① 39 u 5 1 2 3 3 4 3 6

a.     (16 pt.) With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from “w” to all network nodes. Show how the algorithm works by computing the table below. Note: If there exists any tie in each step, choose the left-most column first.

Step	N’	D(s), p(s)	D(t), p(t)	D(u), p(u)	D(v), p(v)	D(x), p(x)	D(y), p(y)	D(z), p(z)
0
1
2
3
4
5
6
7

b.     (7 pt.) Construct the shortest path tree from the above routing table (Hint: Slide 4-86).

c.     (7 pt.) Construct a forwarding table from the above routing table (Hint: Slide 4-86).

Destination	Link

Answer 1

Solution Dijkstra's shortest-path from "w to all nodes In every step follow the Dijkstra's algorithm to fill the table At each step find the shortest path from source node "w" to destination node D(s), D(t), D(u),D(v),D(x), D(v). D(z), p(s) P(t) p(u)p(v) p(x) P(Y)p(Z) Step N' 0 3,w 4,vw wu wuv 6.w 6,t 10.t 10,t 10.t 10,t 10.t wuvt 4 wuvty6.t 5.u 5 uvtys 6,t 5,u wuvtysx6.t 5.u 6.w 3,w 4,vw 6.w 6.w

LER 4 ろ