Solution to CSE 489/589Homework Assignment 3
Prepared by Hung Q. Ngo
*
Problem 1.
Consider the graph in Figure 1. Assume the routing tables contain only two fields: the
destination and the next node router. Using
Dijkstra’s algorithm
, compute the routing table at
node F
.
Show work by using the table of iterations of the algorithm as we did in class. No points will be given if
you only give the final shortest path tree and/or the routing table.
Figure 1: Network of routers for this question
Iteration
The Set T
Node A
Node B
Node C
Node D
Node E
Node F
0
∅
Nil,
∞
Nil,
∞
Nil,
∞
Nil,
∞
Nil,
∞
Nil,
0
1
F
F, 2
F,3
2
F,A
A,12
A,4
3
F,A,D
D,6
D,11
4
F,A,D,E
E,10
5
F,A,D,E,B
B,9
6
F,A,D,E,B,C
Draw your tree here
Your routing table for node F here
Two branches: F–D–B–C, F–A–E
Destination
Next Router
A
A
B
D
C
D
D
D
E
A
*
Please let me know of any mistake/typo ASAP.
1