Fall 2021
ENSC 427: COMMUNICATION NETWORKS

Assignment #10:

Read:
  • Kurose and Ross: Chapter 7: Wireless and Mobile Networks

  • Prepare for the Midterm exam no. 2: November 22, 2021.

  • 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 (Fall 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. F. Kurose and K. W. Ross, Computer Networking, 8th Edition, Pearson, 2021.

    Posted: November 12, 2021
    Due: November 21, 2021

    Last modified: Sat 13 Nov 2021 17:00:42 PST.