ITEC 350

Assignment #3

Problem 7.32 and Problem 7.33 of the textbook (page 567).

Figure 7.30

7.32 Consider the network in Figure 7.30

a) Use the Bellman-Ford algorithm to find the set of shortest paths from all nodes to destination node 2.

b) Now continue the algorithm after the link between node 2 and 4 goes down. (Note: Assume that we do not use Split Horizon or Poisoned Reverse)

Hint: The answers for problem (a) and (b) should be in the following format respectively. The following shows the set of shortest paths from all nodes to destination node 6.

7.33 Consider the network in Figure 7.30

a) Use the Dijkstra algorithm to find the set of shortest paths from node 4 to other nodes.

Hint: The answer should be in the following format. You should include both a table and network topologies. The following shows the set of shortest paths from node 1 to other nodes.

b) Find the set of associated routing table entries.

Hint: The answer should be in the following format.