Unit Four Test, CSCI 361 Introduction to Computer Networks, 15-April-08

 1)Give four design tradeoffs when making a selection between virtual
   circuits and datagrams.  Also, explain how the protocol stack can
   "mix-n-match" virtual circuits and datagrams.
   
 2)Describe the role of the "shortest path" algorithm and list four
   possible parameters which may contribute to this abstraction.

 3)Explain how distance vectoring builds a sink tree and the subsequent problem
   with good versus bad news.

 4)Explain why routers attached to a LAN require a pseudo node to perform
   link state routing.

 5)Describe three implementation steps to RPF and give three reasons why it
   is better than flooding.

 6)Define hash, node identifier, key, and finger table.  Explain how these 
   concepts can be used to implement a peer-to-peer network.

 7)Define "congestion" and explain how the solution is a "balance."

 8)Describe the four steps of "choke" control between two nonadjacent nodes. 

 9)Define CIDR and give it's design tradeoff. Explain how in one sense IP
   addresses are scarce, yet in another there are plenty to go around.

10)Describe the basic table columns entries and explain how packet NAT is
   implemented.

Bonus:
  Define Proxy ARP explain how it is used and how it can lead to problems.