Review this week’s reading and briefly explain how does an entry get into a router’s forwarding table?
Consider the seven-node network on the right. Show the minimal-cost tree rooted at z that includes (as end hosts) nodes u, v, w, and y.
Consider the network in Question 2 (with nodes labeled t to z). With the indicated link costs, use Dijkstra’s shortest-path algorithm (provided below) to compute the shortest path from node t to all network nodes. Show how the algorithm works by computing a table similar to the one provided.
Read slide 5.78 and 5.79 “Traceroute and ICMP”. Run traceroute on your computer to at least two different servers, one in Europe and the other one in Asia. Include the screenshots of your execution of the traceroute and briefly explain your result.