Assignment 5 

Due November 7 at class.

1. W & V, Chapter 4 Problem 4

2. W & V, Chapter 4 Problem 6

3. W & V, Chapter 4 Problem 7

4. W & V, Chapter 4 Problem 8

5. Give a simple algorithm for finding
two paths through a network from a  given
source to a  given destination that can
survive any lose of a single communication line.

6. A Class B network on the Internet has a subnet
mask of 255.255.240.0. How many hosts can be on
the subnet?

7. Consider a 3 layer hierarchical routing scheme
with 4800 routers. How many clusters (the top
level entity) and how many regions (the second
level entity) should there be to minimize the
size of the router tables. In other words, there
are N routers/regions and M regions/cluster.

8. The next IP version, IPv6, has 16-byte addresses.
Suppose the issuing athorities give out addresses
in blocks of one million (1024*1024) addresses 
every second. For how long will there be
enough addresses?