NET2201 COMPUTER NETWORKS
TUTORIAL QUESTIONS FOR CHAPTERS 4 AND 5: NETWORK LAYER
1. Consider the following network. With the indicated link costs, use Dijkstra’s shortest-
path algorithm to compute the shortest path from x to all network nodes. Show how the
algorithm works in a table. (7 marks)
Step
N’
D(t),p(t)
D(u),p(u)
D(v),p(v)
D(w),p(w)
D(y),p(y)
D(z),p(z)
0
x
-
-
3,x
6,x
6,x
8,x
1
xv
7,v
6,v
-
6,x
6,x
8,x
2
xvu
7,v
-
-
6,x
6,x
8,x
3
xvuw
7,v
-
-
-
6,x
8,x
4
xvuwy
7,v
-
-
-
-
8,x
5
xvuwyt
-
-
-
-
-
8,x
6
xvuwytz
-
-
-
-
-
-
