# a3 - CSE 489/589Homework Assignment 3 Due at the end of...

• Notes
• 4

This preview shows pages 1–3. Sign up to view the full content.

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 0 Nil, Nil, Nil, Nil, Nil, Nil, 0 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

This preview has intentionally blurred sections. Sign up to view the full version.

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 0 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 0 .) 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.
This is the end of the preview. Sign up to access the rest of the document.
• Fall '10
• hungngo
• Networking, Router, Shortest path problem, Classless Inter-Domain Routing, Border Gateway Protocol, internet architecture

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern