INST 346
Technologies, Infrastructure and Applications
Spring 2018
Assignment H6

Create optimal (i.e., shortest path) routing tables for three nodes (CASE, CARNEGIE, and UCLA) in the ARPANET as it existed in December 1970 using the December 1970 ARPANET map available at http://som.csudh.edu/fac/lpress/history/arpamaps/. Assume that every link has an estimated delay of 1 second (i.e., assume that the weight on each link is 1, regardless of how long the line is). You can ignore the big circles -- those just show where the scale of the map is blown up larger for clarity -- LINCOLN, MIT, BBN and HARVARD are all in or near Boston, and UCSB, UCLA, RAND and SDC are all in or near Los Angeles. You can use any method you like to create your routing tables (e.g., you could use Dijkstra's shortest path algorithm, but you may find it easier to just enumerate several possible paths until you start to see some obvious patterns that make the answer clear). Your routing tables should look something like this:

Routing Table for CASE

In that table, CASE is where you are (i.e., the node you are routing from), the Destination is where you want to send your packet to, the Next Hop is the next node you should send your packet to if you are at CASE and you want to send a packet to the Destination, and Estimated Delay is how many links your packet will need to traverse to move between CASE and the Destination. In each of your three routing tables you must label it with which node you are presenting the routing table for (CASE, CARNEGIE, or UCLA) and you must list the Destinations in alphabetical order (e.g., SDC must be listed immediately after RAND and immediately before SRI). As a warning, that example table above has nonsense values in it, just to show you what a routing table should look like -- YOU have to figure out the correct values!

Submit your assignment on ELMS before class on the date shown in the course schedule.