Spring 2021
ENSC 427: COMMUNICATION NETWORKS

Assignment #10:

Read:
  • Kurose and Ross: Chapter 6: The Link Layer and LANs

  • Consider the network shown in Figure 1. With the indicated link costs, use Dijkstra's algorithm to compute the shortest path from z to all network nodes. Show how the algorithm works by computing an appropriate table. Draw the shortest path tree found by the algorithm.
  • Consider the network shown in Figure 2. Assume that each node initially knows the costs to each of its neighbors. Use Bellman-Ford algorithm and show the routing table entries at node z.

  • Include the cover page. It should only include:
        course title (ENSC 427: COMMUNICATION NETWORKS),
        term (Spring 2021),
        assignment number,
        your full name (last name, first name),
        your SFU ID,
        your SFU email address.
        This page should not be counted in the required page limit.

    • Text:
    J. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach, 7/e, Pearson, 2017.

    Posted: March 12, 2021
    Due: March 21, 2021

    Last modified: Fri 12 Mar 2021 23:45:43 PST.