1. (10 points) An IP datagram using the Strict source routing option has to be fragmented. Do you think the option is copied into each fragment, or is it sufficient to just put it in the first     fragment? Explain your answer

2. (10 points) A class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?

3. (10 points) IPv6 uses 16-byte addresses. If a block of 1 million addresses is allocated every picosecond, how long will the addresses last?

4. (10 points) A new virtual circuit is being set up in an ATM network.  Between the source and destination hosts lie three ATM switches. How many messages (including acknowledgements)  will be sent to establish the circuit?

5. (10 points) Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the identification number 422. How many          fragments are generated? What are the values in the various fields in the IP datagram(s)             generated related to fragmentation?

6. (30 points) Consider the network shown below.

Using Dijkstra's algorithm and showing your work. do the following:

a.   Compute the shortest path from t to all network nodes.

b.   Compute the shortest path from u to all network nodes.

c.    Compute the shortest path from v to all network nodes.

d.   Compute the shortest path from w to all network nodes.

e.    Compute the shortest path from y to all network nodes.

f.    Compute the shortest path from z to all network nodes.