This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 489/589Homework Assignment 3 Due at the end of class on Wednesday, Nov 17. * 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 ∅ Nil, ∞ Nil, ∞ Nil, ∞ Nil, ∞ Nil, ∞ Nil, 1 2 3 4 5 6 Draw your tree here Your routing table for node F here Destination Next Router A B C D E * Please let me know of any mistake/typo ASAP. 1 Problem 2. Consider the network in Figure 2. Suppose the routing tables’s entries for destination F Figure 2: Network of routers for this question at time are shown below. Also assume that all routers are perfectly synchronized so that they all send updates at the same time slot. (The table below shows the table states at time .) Compute the routing table entries for destination F as the Distance Vector protocol is run over time, until no further changes are possible for any table....
View Full Document
This note was uploaded on 12/03/2010 for the course CS 489 taught by Professor Hungngo during the Fall '10 term at SUNY Buffalo.
- Fall '10