Consider a network with the topology shown below. Each link is labelled with its link cost.
D
1
A
•B
2
C
4
10
6
E
A. [5] Use Dijkstra's shortest path algorithm, construct the set of the least cost paths (and their associated
path costs) from S to all other nodes. Show all the steps using the format in the first table shown below.
D(x) is the current path cost estimate from node S to node x. p(x) is the predecessor node to node x on
the path from S.
B. [5] Give the forwarding table for S using the format in the second table shown below. Identify each link
using the notation (a, b), where a/b is the starting/ending node of the link. For example, the link from node
S to node A is denoted by (S,A).
Please type text in your answers. Please click "Insert" and then choose "Table" to insert a table as shown
below:
12pt
Embed
Table for part A:
Step
N
D(A), p(A)
D(B), p(B)
D(C), p(C)
D(D), p(D)
0
S
?,?
?,?
?,?
?,?
D(E), p(E)
?,?
1
S?
?,?
??
??
??
?,?
:
Table for part B:
Destination
Link
A
(S,?)
B
(S,?)
C
(S, ?)
D
(S,?)
E
(S, ?)
