Spring 2022
ENSC 833: NETWORK PROTOCOLS AND PERFORMANCE
Assignment #10:
Read:
Kurose and Ross: Chapter 5: The Network Layer: Control Plane
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 833: NETWORK PROTOCOLS AND PERFORMANCE),
term (Spring 2022),
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.
Work on the final projects.
Review:
Instructions for in class
presentations of your final projects
Instructions for writing
ENSC 833 final project reports
The final project grading policy
The final project grading form (details).
Text:
J. F. Kurose and K. W. Ross,
Computer Networking, 8th Edition, Pearson, 2021.
Posted:
March 11, 2022
Due:
March 20, 2022
Last modified:
Sun 13 Mar 2022 22:24:01 PDT.