Consider the network shown below. Assume that the tie-breaker goes to the node with a smaller ID.
a) Suppose each node runs the Link State routing protocol and the Dijkstra's algorithm. Show step by step (as we did in class) how node #5 computes its shortest paths to all other nodes in the network.
b) After the network stabilizes, show node #5's routing table.
c) Suppose each node instead runs the Distance Vector routing protocol with SHPR (Split Horizon with Poisoned Reverse). Show step by step (as we did in class) how to find the shortest path from each node to destination node #1.
d) Suppose the link between node #2 and node #5 is broken after the protocol converges in Problem (c). Show step by step how the protocol continues till convergence again.
2
3
1
5
7
4
N
2
6
3
2
2
5
3