** NOTE: The "Walrand 2nd ed." problems are in your textbook.

Walrand 2nd ed. #2.6: In "m; a.j, x", "m" is the name of the computer, "a.j" is the network address of which "a" is the number of the subnet (the LAN) and "j" is the number of the computer within that subnet, and "x" is the physical address. In addition, R1 is the name of a router, and L1 is the name of a link. Label the routing table columns.

Walrand 2nd ed. #2.7: Label the ARP table columns.

Walrand 2nd ed. #3.1: In the last question "What happens ...", comment on the lookup time.

Walrand 2nd ed. #3.2: You don't need to answer the "Comment on the effect of ..." question.

Walrand 2nd ed. #3.4:

Walrand 2nd ed. #3.6:  In figure 3.24, if "D,E" appears in the diagram, then change this to "E".

Walrand 2nd ed. #3.7: Only calculate shortest paths using node A as the source.

Walrand 2nd ed. #3.10: In (a), first find the quickest path from the source to each individual destination. Then add up the delays, only counting the delay on each link once, e.g. a link used to get to 2 destinations only counts once in the sum. In (b), find a set of paths to use that result in a lower total delay than you found in part (a).