Spring 2019
ENSC 427: COMMUNICATION NETWORKS
Assignment #10:
Read:
Kurose and Ross: Chapter 5: The Network Layer: Control Plane
Consider the network shown in Figure 1.
Derive routing tables to show each step in routing a packet from node 1 to node 8
using the Bellman-Ford and Dijkstra shortest path algorithms.
Include the cover page. It should only include course title
(ENSC 427: COMMUNICATION NETWORKS),
term (Spring 2019), assignment number,
your full name (last name, first name),
your SFU ID,
and your SFU email address.
This page should not be counted in the required page limit.
Work on the final projects.
Review:
Instructions for in class
presentations of your final projects
Instructions for writing
ENSC 427 final project reports
The final project grading policy
The final project grading form (details).
Text:
J. Kurose and K. W. Ross,
Computer Networking: A Top-Down Approach, 7/e,
Pearson, 2017.
Posted:
March 8, 2019
Due:
March 17, 2019
Last modified:
Fri Mar 8 22:55:32 PST 2019.